/*二叉树的建立shudefeidigui及先序、中序、后序遍历的递归*/
#define NULL 0
#include <stdio.h>
typedef struct bitnode
{char data;
struct bitnode *lchild,*rchild;
}bitnode,*bitree;
void creatree(bitree *t)
{ char ch;
scanf("%c",&ch);
if(ch=='.')*t=NULL;
else
{*t=(bitree)malloc(sizeof(bitnode));
(*t)->data =ch;
creatree(& (*t)->lchild);
creatree(& (*t)->rchild);
}
}
void pre(bitree t)
{if(t)
{printf("%c",t->data);
pre(t->lchild);
pre(t->rchild);
}
}
void in(bitree t)
{if(t)
{
in(t->lchild);
printf("%c",t->data);
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余1页未读,立即下载