二叉树

#include<stdio.h>
#include<stdlib.h>


typedef struct BiTNode{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;



void CreateBiTree(BiTree * T){
char c;
scanf("%c",&c);
if (' ' == c){
*T = NULL;
}else{
*T = (BiTNode *)malloc(sizeof(BiTNode));
(*T)->data = c;
CreateBiTree(&((*T)->lchild));
CreateBiTree(&((*T)->rchild));
}


}
//访问二叉树节点具体操作
void visit(char c){
printf("%c ",c);
}
//遍历二叉树  前序
void PreOrderTraverse(BiTree T){
if(T){
visit(T->data); 
PreOrderTraverse(T->lchild);
PreOrderTraverse(T->rchild);
}
}
//遍历二叉树  中序
void InOrderTraverse(BiTree T){
if(T){
InOrderTraverse(T->lchild);
visit(T->data);
InOrderTraverse(T->rchild);
}
}
//遍历二叉树  后序
void PostOrderTraverse(BiTree T){
if(T){
PostOrderTraverse(T->lchild);
PostOrderTraverse(T->rchild);
visit(T->data); 
}
}
//竖向打印树
void Print(BiTree T,int layer){
int i;
if(T == NULL) return;
Print(T->rchild,layer+1);
for(i=0; i<layer;i++)
printf(" ");
printf("%c\n",T->data);
Print(T->lchild,layer+1);
}
int main(){
int level = 1;
int layer =0;
BiTree T; 
printf("请输入二叉树元素，以空格代表空子树，先序输入\n");
CreateBiTree(&T);
printf("\n先序输出：");
PreOrderTraverse(T);
printf("\n中序输出：");
InOrderTraverse(T);
printf("\n后序输出：");
PostOrderTraverse(T);
printf("\n竖向打印：\n");
Print(T,layer);
return 0;
}