数据库第三天

递归二叉树

`#include<stdio.h>
#include<malloc.h>
typedef struct Node{
char data;
struct Node lchild,rchild;
}bintree;
bintree creat(){
bintreetree;
char x=getchar();
if(x==’#’) return NULL; //这个函数没有返回类型不能返回NULL
tree=(bintree*)malloc(sizeof(bintree));
tree->lchild=NULL; tree->rchild=NULL;
tree->data=x;
tree->lchild=creat();
tree->rchild=creat();
return tree;
}
void preorder(bintree* tree){
if(tree==NULL) return NULL;
printf("%c ",tree->data);
preorder(tree->lchild);
preorder(tree->rchild);

}
void inorder(bintree* tree){
if(treeNULL) return NULL;
inorder(tree->lchild);
printf("%c ",tree->data);
inorder(tree->rchild);
}
void postorder(bintree* tree){
if(treeNULL) return NULL;
postorder(tree->lchild);
postorder(tree->rchild);
printf("%c “,tree->data);
}
main(){
bintree *tree;
tree=creat();
preorder(tree);
printf(”\n");
inorder(tree);
printf("\n");
postorder(tree);
}
//ABD###CE##F##
``