数据结构之二叉树

最新推荐文章于 2022-10-25 21:32:39 发布

不要绝望总会慢慢变强

最新推荐文章于 2022-10-25 21:32:39 发布

阅读量140

点赞数

分类专栏：数据结构学习

本文链接：https://blog.csdn.net/luoshiyong123/article/details/81743678

版权

数据结构学习专栏收录该内容

42 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<stack>
#include<queue>
using namespace std;
typedef struct tnode TN;
typedef struct tnode* TT;
struct tnode{
    int data;
    TT left,right;
};
void  creatree(TT &k)            //前序遍历建立二叉树
{
    int data1;
    printf("请输入该分支的头节点：");
    cin >> data1;
    if (data1 ==-1)
        k = NULL;
    else{
        k = (TT)malloc(sizeof(TN));
        k->data = data1;
        creatree(k->left);
        creatree(k->right);
    }
}
void preorder(TT root)          //前序遍历
{
    if (root){
        printf("%d ", root->data);
        preorder(root->left);
        preorder(root->right);
    }
}
四种非递归遍历方法

void preorder2(TT root)                        //前序遍历
{
    stack<TT> sk;
    TT wk = root;
    while (wk || !sk.empty())
    {
        while (wk)                         //直到左子树为空的时候
        {
            sk.push(wk);
            cout << wk->data << " ";
            wk = wk->left;                
        }
        if (!sk.empty())
        wk= sk.top()->right; sk.pop();        //为空时栈顶为最短父节点，遍历该父节点的右子树
    }
}
void midorder(TT root)                            //中序遍历
{
    TT wk = root;
    stack<TT> sk;
    while (wk||!sk.empty())
    {
        while (wk)
        {
            sk.push(wk);
            wk = wk->left;
        }
        if (!sk.empty())
        {
            wk = sk.top(); sk.pop();
            cout << wk->data<<" ";
            wk = wk->right;
        }
    }
}
void postorder(TT root)                //后序遍历
{
    stack<TT> sk;
    TT wk = root;                         //工作指针
    TT r = NULL;                        //标志指针
    while (wk || !sk.empty())
    {
        if (wk){                         //wk非空
            sk.push(wk);
            wk = wk->left;
        }
        else
        {
            wk = sk.top();
            if (wk->right&&wk->right != r)      //右子树存在且没有被访问过
            {
                wk = wk->right;
            }
            else
            {
                cout << wk->data << " ";
                sk.pop();
                r = wk;                              //表示该节点已经访问
                wk = NULL;                           //下一步要么结束要么wk等于栈顶元素继续访问左子树或者右子树---所以令其为空
            }
        }
    }
}

void levelorder(TT root)                                //层次遍历
{
    queue<TT> sk;                                   //由层次遍历的特点：左子树先访问，而且左子树的孩子也先访问
    TT wk = root;
    sk.push(wk);
    while (!sk.empty())
    {
        wk = sk.front();
        cout <<wk->data << " ";
        if (wk->left != NULL)sk.push(wk->left);
        if (wk->right != NULL)sk.push(wk->right);
        sk.pop();
    }
}
int main()
{
    TT st=NULL;
    cout << "前序遍历建立二叉树："<<endl;
    creatree(st);
    cout << "前序遍历1：" << endl;
    preorder(st);
    cout << endl;
    cout << "前序遍历2：" << endl;
    preorder2(st);
    cout << endl;
    cout << "中序遍历：" << endl;
    midorder(st);
    cout << endl;
    cout << "后序遍历：" << endl;
    postorder(st);
    cout << endl;
    cout << "层次遍历：" << endl;
    levelorder(st);
    return 0;
}