#include "head.h"
void main()
{
BinTNode*t=NULL;
printf("请输入先序序列,输入形式(ABD##E##CFG####):\n");
t=CreateBinTree();
printf("广义表表示的二叉树的输出:\n");
listbintree(t);
printf("\n");
printf("二叉树的前序遍历结果:\n");
xianxu(t);
printf("\n");
printf("二叉树的中序遍历结果:\n");
zhongxu(t);
printf("\n");
printf("二叉树的后序遍历结果:\n");
houxu(t);
printf("\n");
printf("\n");
}
#include "stdio.h"
#include "malloc.h"
typedef struct node
{
char data;
struct node *lchild;
struct node *rchild;
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余3页未读,立即下载