二叉树链表实现及先序、中序、后序、层序遍历

最新推荐文章于 2023-04-18 21:14:51 发布

z-k

最新推荐文章于 2023-04-18 21:14:51 发布

阅读量725

点赞数

分类专栏： OJ

本文链接：https://blog.csdn.net/weixin_40673608/article/details/84311117

版权

OJ 专栏收录该内容

49 篇文章 6 订阅

订阅专栏

#include <iostream>
#include <queue>
#include <string>
using namespace std;
class BiTreeNode
{
public:
    char data;
    BiTreeNode *LeftChild;
    BiTreeNode *RightChild;
    BiTreeNode():LeftChild(NULL),RightChild(NULL){}
    ~BiTreeNode(){}
};
class BiTree
{
public:
    BiTreeNode *Root;
    int pos;
    string strTree;
    BiTreeNode *CreateBiTree();
    void PreOrder(BiTreeNode *t);
    void InOrder(BiTreeNode *t);
    void PostOrder(BiTreeNode *t);
    void level_Order(BiTreeNode *t);
public:
    BiTree(){};
    ~BiTree(){};
    void CreateTree(string TreeArray);
    void PreOrder();
    void InOrder();
    void PostOrder();
    void exchange(BiTreeNode *t);
};
void BiTree::exchange(BiTreeNode *t)
{
    if(t!=NULL)
    {
        exchange(t->LeftChild);
        exchange(t->RightChild);
        BiTreeNode *temp;
        temp = t->LeftChild;
        t->LeftChild = t->RightChild;
        t->RightChild = temp;
    }
}
void BiTree::CreateTree(string TreeArray)
{
    pos=0;
    strTree.assign(TreeArray);
    Root =CreateBiTree();
}
BiTreeNode *BiTree::CreateBiTree()
{
    BiTreeNode *T;
    char ch;
    ch= strTree[pos++];
    if(ch == '#')
        T=NULL;
    else
    {
        T=new BiTreeNode();
        T->data=ch;
        T->LeftChild = CreateBiTree();
        T->RightChild = CreateBiTree();
    }
    return T;
}
void BiTree::PreOrder()
{
    if(strTree[0]=='#')
        cout<<"NULL";
    else
        PreOrder(Root);
    cout<<endl;
}
void BiTree::PreOrder(BiTreeNode *t)
{
    if(t)
    {
        cout<<t->data<<' ';
        PreOrder(t->LeftChild);
        PreOrder(t->RightChild);
    }
}
void BiTree::InOrder()
{
    if(strTree[0]=='#')
        cout<<"NULL";
    else
        InOrder(Root);
    cout<<endl;
}
void BiTree::InOrder(BiTreeNode *t)
{
    if(t)
    {
        InOrder(t->LeftChild);
        cout<<t->data<<' ';
        InOrder(t->RightChild);
    }
}
void BiTree::PostOrder()
{
    if(strTree[0]=='#')
        cout<<"NULL";
    else
        PostOrder(Root);
    cout<<endl;
}
void BiTree::PostOrder(BiTreeNode *t)
{
    if(t)
    {
        PostOrder(t->LeftChild);
        PostOrder(t->RightChild);
        cout<<t->data<<' ';
    }
}
void BiTree::level_Order(BiTreeNode *t)
{
    if(strTree[0]=='#')
        cout<<"NULL";
    else
    {
        queue<BiTreeNode*> qt;
        BiTreeNode *p=t;
        qt.push(p);
        while(1)
        {
            p=qt.front();
            qt.pop();
            cout<<p->data<<' ';
            if(p->LeftChild)
                qt.push(p->LeftChild);
            if(p->RightChild)
                qt.push(p->RightChild);
            if(qt.empty())
                break;
        }
    }
    cout<<endl;
}
int main()
{
    int t;
    cin>>t;
    string s;
    while(t--)
    {
        cin>>s;
        BiTree t;
        t.CreateTree(s);
        t.PreOrder();
        t.InOrder();
        t.PostOrder();
        t.level_Order(t.Root);
    }
}