[数据结构] 二叉树创建与遍历（递归）

#include <iostream>
#include <string>
using namespace std;

class BiTreeNode
{
public :
    char data;
    BiTreeNode *LeftChild;
    BiTreeNode *RightChild;
    BiTreeNode():LeftChild(NULL), RightChild(NULL){}
    ~BiTreeNode(){}
};

class BiTree
{
private:
    BiTreeNode *Root;
    int pos;
    string strTree;
    BiTreeNode* CreateBiTree();
    void PreOrder(BiTreeNode *t);
    void InOrder(BiTreeNode *t);
    void PostOrder(BiTreeNode *t);
public:
    BiTree(){};
    ~BiTree(){};
    void CreateTree(string TreeArray);
    void PreOrder();
    void InOrder();
    void PostOrder();
};

//-----------先序遍历-----------
void BiTree::PreOrder()
{
    BiTreeNode *t;
    t = Root;
    PreOrder(t);
}

void BiTree::PreOrder(BiTreeNode *t)
{
    if(t)
    {
        cout<<t->data;
        PreOrder(t->LeftChild);
        PreOrder(t->RightChild);
    }
}

//------------中序遍历-----------
void BiTree::InOrder()
{
    BiTreeNode *t;
    t = Root;
    InOrder(t);
}

void BiTree::InOrder(BiTreeNode *t)
{
    if(t)
    {
        InOrder(t->LeftChild);
        cout<<t->data;
        InOrder(t->RightChild);
    }
}



//------------后序遍历-----------
void BiTree::PostOrder()
{
    BiTreeNode *t;
    t = Root;
    PostOrder(t);
}
void BiTree::PostOrder(BiTreeNode *t)
{
    if(t)
    {
        PostOrder(t->LeftChild);
        PostOrder(t->RightChild);
        cout<<t->data;
    }
}

void BiTree::CreateTree(string TreeArray)
{
    pos=0;
    strTree.assign(TreeArray);
    Root = CreateBiTree();
}

BiTreeNode* BiTree::CreateBiTree()
{
    BiTreeNode *T;
    char ch;
    ch = strTree[pos++];
    if(ch=='0' || ch==0)
        T=NULL;
    else
    {
        T = new BiTreeNode();
        T->data = ch;
        T->LeftChild = CreateBiTree();
        T->RightChild = CreateBiTree();
    }
    return T;
}



int main()
{
    BiTree test;
    string str;
    cin>>str;
    test.CreateTree(str);
    test.PreOrder(); cout<<endl;
    test.InOrder(); cout<<endl;
    test.PostOrder(); cout<<endl;
}