【数据结构】二叉树的遍历

二叉树的遍历

#include <bits/stdc++.h>
using namespace std;

template <typename DataType>
struct BiNode{
    DataType data;
    BiNode<DataType> *lchild,*rchild;
};

template<typename DataType>
class BiTree{
public:
    BiTree(){root=Creat();}
    ~BiTree(){Release(root);}
    void PreOrder(){PreOrder(root);}
    void InOrder(){InOrder(root);}
    void PostOrder(){PostOrder(root);}
    void LevelOrder();
private:
    BiNode<DataType>*Creat();
    void Release(BiNode<DataType>*bt);
    void PreOrder(BiNode<DataType>*bt);
    void InOrder(BiNode<DataType>*bt);
    void PostOrder(BiNode<DataType>*bt);
    BiNode<DataType>*root;
};

template<typename DataType>
void BiTree<DataType>::PreOrder(BiNode<DataType>*bt){
    if(bt==NULL)
        return;
    else{
        cout<<bt->data<<" ";
        PreOrder(bt->lchild);
        PreOrder(bt->rchild);
    }
}

template<typename DataType>
void BiTree<DataType>::LevelOrder(){
    BiNode<DataType>*Q[100],*q=NULL;
    int front=-1,rear=-1;
    if(root==NULL)
        return;
    Q[++rear]=root;
    while(front!=rear){
        q=Q[++front];
        cout<<q->data<<" ";
        if(q->lchild!=NULL) Q[++rear]=q->lchild;
        if(q->rchild!=NULL) Q[++rear]=q->rchild;
    }
}

template<typename DataType>
BiNode<DataType> *BiTree<DataType>::Creat(){
    BiNode<DataType> *bt;
    char ch;
    cin>>ch;
    if(ch=='#')
        bt=NULL;
    else{
        bt=new BiNode<DataType>;
        bt->data=ch;
        bt->lchild=Creat();
        bt->rchild=Creat();
    }
    return bt;
}


template<typename DataType>
void BiTree<DataType>::InOrder(BiNode<DataType>*bt){
    if(bt==NULL)
        return;
    else{

        InOrder(bt->lchild);
        cout<<bt->data<<" ";
        InOrder(bt->rchild);
    }
}

template<typename DataType>
void BiTree<DataType>::PostOrder(BiNode<DataType>*bt){
    if(bt==NULL)
        return;
    else{

        PostOrder(bt->lchild);
        PostOrder(bt->rchild);
        cout<<bt->data<<" ";
    }
}

template<typename DataType>
void BiTree<DataType>::Release(BiNode<DataType>*bt){
    if(bt==NULL)
        return;
    else{
        Release(bt->lchild);
        Release(bt->rchild);
        delete bt;
    }
}

int main()
{
    BiTree<char> T;

    cout<<"前序遍历:";
    T.PreOrder();
    cout<<endl;
    cout<<"中序遍历";
    T.InOrder();
    cout<<endl;
    cout<<"后序遍历";
    T.PostOrder();
    cout<<endl;
    cout<<"层序遍历";
    T.LevelOrder();
    cout<<endl;
    return 0;
}