基于二叉链表的二叉树的三序遍历
描述
设二叉树中每个结点的元素均为一个字符,按先序遍历的顺序建立二叉链表,编写递归算法实现该二叉树的三序遍历(三序遍历是指对于二叉树的每一个结点来说,先访问这个结点,再按三序遍历它的左子树,然后再一次访问这个结点,接下来按三序遍历它的右子树,最后再一次访问这个结点)。
输入
多组数据。每组数据一行,为二叉树的先序序列(序列中元素为‘0’时,表示该结点为空)。当输入只有一个“0”时,输入结束。
输出
每组数据输出一行,为三序遍历法得到的二叉树序列。
输入样例 1
ab000 ab00c00 0
输出样例 1
abbbaa abbbaccca
示例一(刘健淳)
#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
#define OK 1
#define ERROR 0
typedef struct BiTNode
{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
void Input(BiTree &T,char c[],int &i)
{
if(c[i]=='0')
T=NULL;
else
{
T=new BiTNode;
T->data=c[i];
Input(T->lchild,c,++i);
Input(T->rchild,c,++i);
}
}
/*
void Count(BiTree &T)
{
if(T)
{
num++;
Count(T->lchild);
Count(T->rchild);
}
}
*/
/*
void Output1(BiTree &T)
{
if(T)
{
cout<<T->data;
Output1(T->lchild);
Output1(T->rchild);
}
}
void Output2(BiTree &T)
{
if(T)
{
Output2(T->lchild);
cout<<T->data;
Output2(T->rchild);
}
}
void Output3(BiTree &T)
{
if(T)
{
Output3(T->lchild);
Output3(T->rchild);
cout<<T->data;
}
}
void Output(BiTree &T)
{
if(T)
{
cout<<T->data;
Output1(T->lchild);
Output2(T->lchild);
Output3(T->lchild);
cout<<T->data;
Output1(T->rchild);
Output2(T->rchild);
Output3(T->rchild);
cout<<T->data;
}
}
*/
void Output(BiTree &T)
{
if(T)
{
cout<<T->data;
Output(T->lchild);
cout<<T->data;
Output(T->rchild);
cout<<T->data;
}
}
int main()
{
char c[1024];
while(cin>>c&&c[0]!='0')
{
int i=-1;
BiTree T;
Input(T,c,++i);
Output(T);
cout<<endl;
//cout<<num<<endl;
}
return 0;
}
示例二(何京)
#include<stdio.h>
#include<iostream>
using namespace std;
typedef struct BiTNode{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
void CreateBiTree(BiTree &T)
{
char ch;
cin>>ch;
if(ch=='0') T=NULL;
else
{
T=new BiTNode;
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void Traverse(BiTree T)
{
if(T)
{
cout<<T->data;
Traverse(T->lchild);
cout<<T->data;
Traverse(T->rchild);
cout<<T->data;
}
}
int main()
{
BiTree T;
while(1)
{
CreateBiTree(T);
if(!T)
break;
else
{
Traverse(T);
cout<<endl;
}
}
return 0;
}
三、
//abbbaa
//11/23/2020, 14:01
//基于二叉链表的二叉树的三序遍历
#include <iostream>
#define MAX 100
using namespace std;
typedef struct BiTNode {
char data;
struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
//先序遍历:根左右
void CreateBiTree(BiTree& T, char* s, int& i) {
if (s[i] == '0')
T = NULL;
else {
T = new BiTNode;
T->data = s[i]; //根
CreateBiTree(T->lchild, s, ++i);//递归创建左子树
CreateBiTree(T->rchild, s, ++i);
}
}
void TriOrderTraverse(BiTree T) {
if (T) {
cout << T->data;//访问根结点
TriOrderTraverse(T->lchild);//访问左子树
cout << T->data;//访问根结点
TriOrderTraverse(T->rchild);//访问右子树
cout << T->data;//访问根结点
}
}
int main()
{
char ch[MAX];
while (cin >> ch && ch[0] != '0') {
BiTree T;
int i = -1;
CreateBiTree(T, ch, ++i);
TriOrderTraverse(T);
cout << endl;
}
return 0;
}
四、
#include <iostream>
using namespace std;
typedef struct BiTNode
{
char data;
struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
void CreateBiTree(BiTree& T)
{
char ch;
cin >> ch;
if (ch == '0')T = NULL;
else
{
T = new BiTNode;
T->data = ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void CreateBiTree(BiTree& T, char ch)
{
if (ch == '0')T = NULL;
else
{
T = new BiTNode;
T->data = ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void Traverse(BiTree T)
{
if (T)
{
cout << T->data;
Traverse(T->lchild);
cout << T->data;
Traverse(T->rchild);
cout << T->data;
}
}
int main()
{
while (1)
{
char ch;
cin >> ch;
if (ch == '0')break;
BiTree T;
CreateBiTree(T, ch);
Traverse(T);
cout << endl;
}
return 0;
}
五、
// 3004.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include <iostream>
using namespace std;
typedef struct BiTNode {
char data;
struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
void CreateBiTree(BiTree& T) {
char ch;
cin >> ch;
if (ch == '0')T = NULL;
else {
T = new BiTNode;
T->data = ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void TriTravel(BiTree& T)
{
if (T)
{
cout << T->data;
TriTravel(T->lchild);
cout << T->data;
TriTravel(T->rchild);
cout << T->data;
}
return;
}
int main()
{
while (1)
{
BiTree T;
CreateBiTree(T);
if (T == NULL)
break;
TriTravel(T);
cout << endl;
}
return 0;
}
六、
#include<iostream>
using namespace std;
typedef struct BiTNode{
struct BiTNode *lchild,*rchild;
char data;
}BiTNode,*Bitree;
void CreateTree(Bitree &T,char ch[],int &i){
if(ch[i]=='0')
T=NULL;
else{
T=new BiTNode;
T->data=ch[i];
CreateTree(T->lchild,ch,++i);
CreateTree(T->rchild,ch,++i);
}
}
void outs(Bitree &T)
{
if(T)
{
cout<<T->data;
outs(T->lchild);
cout<<T->data;
outs(T->rchild);
cout<<T->data;
}
}
int main(){
while(1){
char ch[100];
cin>>ch;
if(ch[0]=='0')
break;
Bitree bt;
int i=-1;
CreateTree(bt,ch,++i);
outs(bt);
cout<<endl;
}
return 0;
}
七、
#include<iostream>
using namespace std;
typedef struct BiNode{
char data;
struct BiNode *lchild,*rchild;
}BiNode,*BiTree;
void CreateBiTree(BiTree &T,char s[],int &i)
{
if(s[i]=='0') T=NULL;
else
{
T=new BiNode;
T->data=s[i];
CreateBiTree(T->lchild,s,++i);
CreateBiTree(T->rchild,s,++i);
}
}
void PreOrderTraverse(BiTree T)
{
if(T==NULL) return;
else if(T->lchild==NULL&&T->rchild) return;
else{
cout<<T->data;
PreOrderTraverse(T->lchild);
PreOrderTraverse(T->rchild);
}
}
void ThreeTraverse(BiTree T)
{
if(T)
{
cout<<T->data;
ThreeTraverse(T->lchild);
cout<<T->data;
ThreeTraverse(T->rchild);
cout<<T->data;
}
}
int main()
{
char s[100];
while(cin>>s&&s[0]!='0')
{
int i=-1;
BiTree T;
CreateBiTree(T,s,++i);
ThreeTraverse(T);
cout<<endl;
}
}
八、
#include<iostream>
using namespace std;
int sum=0;
typedef struct BiTNode{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*Treelist;
void createtree(Treelist &T)
{
char ch;
cin>>ch;
if(ch=='0')
T=NULL;
else
{
T=new BiTNode;
T->data=ch;
createtree(T->lchild);
createtree(T->rchild);
}
}
void show(Treelist T)
{
if(T!=NULL)
{
cout<<T->data;
show(T->lchild);
cout<<T->data;
show(T->rchild);
cout<<T->data;
}
}
int main()
{
while(1)
{
Treelist T;
createtree(T);
if(T==NULL)
break;
show(T);
cout<<endl;
}
return 0;
}
九、
#include<iostream>
using namespace std;
typedef struct BiTNode {
char data;
struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;
void CreateBT(BiTree &BT)
{
char ch;
cin >> ch;
if (ch == '0')
BT = NULL;
else
{
BT = new BiTNode;
BT->data = ch;
CreateBT(BT->lchild);
CreateBT(BT->rchild);
}
}
void TriTraverseBT(BiTree &BT)
{
if (!BT)
return;
else
{
cout << BT->data;
TriTraverseBT(BT->lchild);
cout << BT->data;
TriTraverseBT(BT->rchild);
cout << BT->data;
}
}
int main()
{
while (1)
{
BiTree BT;
CreateBT(BT);
if (!BT)
break;
TriTraverseBT(BT);
cout << endl;
}
return 0;
}
十、
#include<iostream>
using namespace std;
typedef struct BiTNode{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
void CreatBiTree(BiTree &T)
{
char ch;cin>>ch;
if(ch=='0')T=NULL;
else {
T=new BiTNode;
T->data=ch;
CreatBiTree(T->lchild);
CreatBiTree(T->rchild);
}
}
void CreatBiTree(BiTree &T,char ch)
{
if(ch=='0')T=NULL;
else {
T=new BiTNode;
T->data=ch;
CreatBiTree(T->lchild);
CreatBiTree(T->rchild);
}
}
void travel(BiTree t)
{
if(!t)return;
else{
cout<<t->data;
travel(t->lchild);
cout<<t->data;
travel(t->rchild);
cout<<t->data;
}
}
int main()
{
char ch;
while(cin>>ch&&ch!='0')
{
BiTree t;
CreatBiTree(t,ch);
travel(t);
cout<<endl;
}
}