二叉树的构造与遍历

#include <iostream>
using namespace std;

typedef struct node
{
    char data;
    struct node *lchild;
    struct node *rchild;
}BiTreeNode,*BiTree;

void createBiTree(BiTree &T)
{
    char c;
    cin>>c;
    if(c=='#') T=NULL;
    else{
        T=new BiTreeNode;
        T->data=c;
        createBiTree(T->lchild);
        createBiTree(T->rchild);
    }
}

void preTraverse(BiTree T)
{
    if(T){
        cout<<T->data<<" ";
        preTraverse(T->lchild);
        preTraverse(T->rchild);
    }
}

void midTraverse(BiTree T)
{
    if(T){
        midTraverse(T->lchild);
        cout<<T->data<<" ";
        midTraverse(T->rchild);
    }
}

void postTraverse(BiTree T)
{
    if(T){
        postTraverse(T->lchild);
        postTraverse(T->rchild);
        cout<<T->data<<" ";
    }
}

int main()
{
    BiTree T;
    createBiTree(T);
    cout<<"二叉树构造成功！"<<endl;
    cout<<"先序遍历二叉树："<<endl;
    preTraverse(T);
    cout<<endl;
    cout<<"中序遍历二叉树："<<endl;
    midTraverse(T);
    cout<<endl;
    cout<<"后序遍历二叉树："<<endl;
    postTraverse(T);
    return 0;
}