#include<stdio.h>
#include<string.h>
#include<malloc.h>
#define NULL 0
typedef struct node
{
char data;
struct node *lchild,*rchild;
}bnode,*blink;
blink creat(blink bt)
{
char ch;
ch=getchar();
if(ch!='#')
{
if(!(bt=(bnode*)malloc(sizeof(bnode))))
printf("ERROR!\n");
bt->data=ch; //生成结点
bt->lchild=creat(bt->lchild); //生成左子树
bt->rchild=creat(bt->rchild); //生成右子树
}
else
bt=NULL;
return bt; //读入#,返回空指针
}
void preorder(blink bt) //先序遍历算法
{
if(bt)
{
printf("%c",bt->data);
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余2页未读,立即下载