C++链式二叉树

BiTree：

//链式结构二叉树
#include<iostream>
using namespace std;
#define MAXSIZE 100
typedef char ElemType;

typedef struct BitNode
{
    ElemType data;
    BitNode *lchild;
    BitNode *rchild;
}*BiTree;

//构造空二叉树T
void InitBiTree(BiTree *T)
{
    *T = NULL;
}

//销毁二叉树
void DestroyBiTree(BiTree *T)
{
    if(*T)
    {
        if((*T)->lchild)
            DestroyBiTree(&(*T)->lchild);
        if((*T)->rchild)
            DestroyBiTree(&(*T)->rchild);
        delete(*T);
        *T = NULL;
    }
}

//生成二叉树
void CreateBiTree(BiTree *T)
{
    ElemType ch;
    if((ch=getchar())=='#')
        *T = NULL;
    else
    {
        *T = new BitNode;
        (*T)->data = ch;
        CreateBiTree(&(*T)->lchild);
        CreateBiTree(&(*T)->rchild);
    }
}

//判断是否为空
bool EmptyBiTree(BiTree T)
{
    if(T)
    {
        cout<<"非空"<<endl;
        return false;
    }
    else
    {
        cout<<"空"<<endl;
        return true;
    }
}

#define ClearBiTree DestroyBiTree

//求T深度
int DepthBiTree(BiTree *T)
{
    int i;
    int j;
    if(!(*T))
        return 0;
    if((*T)->lchild)
    {
        i = DepthBiTree(&(*T)->lchild);
        //cout<<"L "<< i <<endl;
    }
    else
        i = 0;
    if((*T)->rchild)
    {
        j = DepthBiTree(&(*T)->rchild);
        //cout<<"R "<< j <<endl;
    }
    else
        j = 0;
    return (i>j ? i+1 : j+1);
}

//返回二叉树的根
ElemType Root(BiTree T)
{
    if(EmptyBiTree(T))
        return 0;
    else
        return (T)->data;
}

//返回p所指结点的值
ElemType Value(BiTree p)
{
    return p->data;
}

//给p所指结点复制value
void Assign(BiTree p, ElemType value)
{
    p->data = value;
}

//前序递归遍历T
void PreOrderTraverse(BiTree T)
{
    if(T==NULL)
        return;
    cout<<T->data;
    PreOrderTraverse(T->lchild);
    PreOrderTraverse(T->rchild);
}

//中序递归遍历T
void InOrderTraverse(BiTree T)
{
    if(T==NULL)
        return;    
    PreOrderTraverse(T->lchild);
    cout<<T->data;
    PreOrderTraverse(T->rchild);
}

//后序递归遍历T
void PosOrderTraverse(BiTree T)
{
    if(T==NULL)
        return;    
    PreOrderTraverse(T->lchild);
    PreOrderTraverse(T->rchild);
    cout<<T->data;
}

int main()
{
    BiTree T;
    ElemType ch;

    InitBiTree(&T);
    CreateBiTree(&T);
    EmptyBiTree(T);
    int d = DepthBiTree(&T);
    cout<<"二叉树深度："<<d<<endl;
    ch = Root(T);
    cout<<"二叉树根："<<ch<<endl;

    cout<<"前序遍历：";
    PreOrderTraverse(T);
    cout<<"
中序遍历：";
    InOrderTraverse(T);
    cout<<"
后序遍历：";
    PosOrderTraverse(T);

    ClearBiTree(&T);
    cout<<"
二叉树为：";
    EmptyBiTree(T);
    cout<<"二叉树深度："<<DepthBiTree(&T)<<endl;
    int i = Root(T);
    if(!i)
        cout<<"树空，无根。"<<endl;

    return 0;
}