树的递归与非递归遍历（C++读文件）

最新推荐文章于 2024-06-03 17:15:00 发布

西境的小狮子

最新推荐文章于 2024-06-03 17:15:00 发布

阅读量461

点赞数

CC 4.0 BY-SA版权

分类专栏： C语言

本文链接：https://blog.youkuaiyun.com/maiowu1001/article/details/77888561

C语言专栏收录该内容

16 篇文章

订阅专栏

该博客介绍了如何从‘tree.in’文件中读取数据构造树，并针对遇到的‘0’处理为空树的情况。接着详细讲解了如何对构建的树进行递归和非递归的四种遍历方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

从“tree.in”文件里读取字符串，构造树，若遇到’0’，则认为是空树，然后对该树进行四种遍历

#include <iostream>
#include <stack>
#include <queue>
#include <string>
#include <cstdlib>
#include <fstream>
using namespace std;

#define ElemType char

typedef struct treeNode {
    struct treeNode * lchild;
    struct treeNode * rchild;
    ElemType data;
}treeNode,* tree;

void createTree(tree & t, string str) {
    static int N = 0;
    if (str.length() <= N)
        return;
    ElemType ch = str[N++];
    if (ch == '0')
        t = NULL;
    else {
        t = (treeNode*)malloc(sizeof(treeNode));
        t->data = ch;
        createTree(t->lchild, str);
        createTree(t->rchild, str);
    }
}

//递归前中后序
void preOrder(tree & t) {
    if (t) {
        std::cout << t->data<<" ";
        preOrder(t->lchild);
        preOrder(t->rchild);
    }
}
void inOrder(tree & t) {
    if (t) {
        inOrder(t->lchild);
        std::cout << t->data<<" ";
        inOrder(t->rchild);
    }
}
void postOrder(tree & t) {
    if (t) {
        postOrder(t->lchild);
        postOrder(t->rchild);
        std::cout << t->data<<" ";
    }
}
void levelOrder(tree & t) {
    queue<tree> q;
    if (t) {
        q.push(t);
        while (!q.empty()) {
            tree temp = q.front();
            cout << temp->data << " ";
            q.pop();
            if (temp->lchild)
                q.push(temp->lchild);
            if (temp->rchild)
                q.push(temp->rchild);
        }
    }
}

//非递归前中后序
void preOrder2(tree &t) {
    stack<treeNode *> s;
    while (!s.empty() || t) {
        if (t) {
            cout << t->data;
            s.push(t);
            t = t->lchild;
        }
        else {
            t=s.top();
            s.pop();
            t = t->rchild;
        }
    }
}
void inOrder2(tree &t) {
    stack<treeNode *> s;
    while (!s.empty ()|| t) {
        if (t) {
            s.push(t);
            t = t->lchild;
        }
        else {
            t = s.top();
            s.pop();
            cout << t->data;
            t = t->rchild;
        }
    }
}
void postOrder2(tree & t) {
    stack<treeNode*> s;
    treeNode * r = NULL;           //辅助指针，指向其最近访问过的结点

    while (!s.empty ()|| t) {
        if (t) {
            s.push(t);
            t = t->lchild;
        }
        else {
            t = s.top();
            if (t->rchild&&t->rchild != r) {
                t = t->rchild;
                s.push(t);
                t = t->lchild;
            }
            else {
                t = s.top();
                s.pop();
                cout << t->data;
                r = t;
                //当出栈的节点没有右孩子或右孩子刚刚被访问过时，访问过它后，再出栈一个元素
                t = NULL;  
            }
        }
    }
}
int main() {
    ifstream ifs;
    ifs.open("tree.in");
    string str;
    ifs >> str;
    cout << str << endl;
    tree t;
    createTree(t, str);
    preOrder(t);
    cout << endl;
    createTree(t, str);
    inOrder(t);
    cout << endl;
    createTree(t, str);
    postOrder(t);
    cout << endl;
    createTree(t, str);
    levelOrder(t);
    cout << endl;
    ifs.close();
    system("PAUSE");
    return EXIT_SUCCESS;
}