二叉树

// 二叉树
typedef struct BiTNode
{
    int data;
    BiTNode *lchild, *rchild;
}BiTNode, *BiTree;

// 定义一个结构的二叉树
// 初始化二叉树
BiTree tree;
tree = new BiTNode;
tree->data = "A";

BiTNode *p;

// 初始化二叉树
BiTree tree;
tree = new BiTNode;
tree->data = "1";

BiTNode *p;

p = new BiTNode;
p->data="2";
p->lchild=NULL;
p->rchild=NULL;
tree->lchild=p;

p = new BiTNode;
p->data="3";
p->lchild=NULL;
p->rchild=NULL;
tree->rchild=p;


p = new BiTNode;
p->data="4";
p->lchild=NULL;
p->rchild=NULL;
tree->lchild->rchild=p;

p = new BiTNode;
p->data="6";
p->lchild=NULL;
p->rchild=NULL;
tree->lchild->rchild->lchild=p;

p = new BiTNode;
p->data="5";
p->lchild=NULL;
p->rchild=NULL;
tree->rchild->rchild=p;

// 前序遍历
void PreOrder(BiTree &T)
{
    if(T)
    {
        cout<data;
        PreOrder(T->lchild);
        PreOrder(T->rchild);
    }
}

// 中序遍历
void InOrder(BiTree &T)
{
    if(T)
    {
        InOrder(T->lchild);
        cout<data;
        InOrder(T->rchild);
    }
}

// 后序遍历
void PostOrder(BiTree &T)
{
    if(T)
    {
        PostOrder(T->lchild);
        PostOrder(T->rchild);
        cout<data;
    }
}


PreOrder(tree);
cout<<"\n";
InOrder(tree);
cout<<"\n";
PostOrder(tree);

/*
124635
264135
642531
*/