#include <stdio.h>
#include <stdlib.h>
typedef struct BitNode
{
char data;
struct BinNode*lchild,*rchild;
}BitNode;
int main()
{
BitNode nodeA,nodeB,nodeD,nodeF,nodeI,nodeL;
memset(&nodeA,0,sizeof(BitNode));
memset(&nodeB,0,sizeof(BitNode));
memset(&nodeD,0,sizeof(BitNode));
memset(&nodeF,0,sizeof(BitNode));
memset(&nodeI,0,sizeof(BitNode));
memset(&nodeL,0,sizeof(BitNode));
//给节点赋值
nodeA.data='A';
nodeA.data='B';
nodeA.data='D';
nodeA.data='F';
nodeA.data='I';
nodeA.data='L';
//存储节点之间的逻辑关系
nodeA.lchild=&nodeB;
nodeA.lchild=&nodeD;
nodeB.lchild=&nodeF;
nodeF.lchild=&nodeL;
nodeD.lchild=&nodeI;
printf("二叉树构建成功!");
printf("先序遍历:");
preOrder(&nodeA);
printf("\n 中序遍历:");
inOrder(&nodeA);
printf("\n 后序遍历:");
lastOrder(&nodeA);
printf("\n");
system("pause");
return 0;
}