#include<cstdio>
#include<malloc.h>
#include<iostream>
using namespace std;
typedef char Elemtype;
typedef struct BiTnode{
char data;
struct BiTnode* lchild;
struct BiTnode* rchild;
}BiTnode,*BiTree;
//前序创建二叉树
void BiTree_creat(BiTree &T){
char c;
scanf("%c" , &c);
if(c == ' ')T = NULL;
else{
T = (BiTnode *)malloc(sizeof(BiTnode));
T->data = c;
BiTree_creat(T->lchild);
BiTree_creat(T->rchild);
}
}
//读取信息
void read_BiTree(char c,int n){
cout<<"内容:"<<c<<"层数:"<<n<<endl;
}
//遍历二叉树
void Travel_BiTree(BiTree T,int level){
if(T){
//此代码以前序遍历为主要方式但在下面注释出中序和后续遍历
read_BiTree(T->data,level);
Travel_BiTree(T->lchild,level+1);
Travel_BiTree(T->rchild,level+1);
}
//中序遍历
/*
if(T){
Travel_BiTree(T->lchild,level+1);
read_BiTree(T->data,level);
Travel_BiTree(T->rchild,level+1);
}
*/
//后续遍历
/*
if(T){
Travel_BiTree(T->lchild,level+1);
Travel_BiTree(T->rchild,level+1);
read_BiTree(T->data,level);
}
*/
}
int main(){
int level = 1;
BiTree T;
BiTree_creat(T);
Travel_BiTree(T,level);
}
此代码以 前序遍历方式创建
但写出了中序和后续的遍历方法