层序输入——先序的递归和非递归遍历

说明

输入数据有多行

每行一个整数n

当输入#时结束数据输入

输入示例

9
5
#

输出示例

非递归
1 2 4 8 9 5 3 6 7 
递归
1 2 4 8 9 5 3 6 7 
非递归
1 2 4 5 3 
递归
1 2 4 5 3 

代码

#include <bits/stdc++.h>
using namespace std;
struct Tree
{
    int data;
    Tree *left;
    Tree *right;
    Tree(int value) : data(value), left(nullptr), right(nullptr){};
};

Tree *CreateTree(int n)
{
    if (n < 1)
        return nullptr;
    Tree *root = new Tree(1);
    queue<Tree *> q;
    q.push(root);
    int i = 2;
    while (!q.empty() && i <= n)
    {
        Tree *node = q.front();
        q.pop();
        if (i <= n)
        {
            node->left = new Tree(i);
            q.push(node->left);
        }
        i++;
        if (i <= n)
        {
            node->right = new Tree(i);
            q.push(node->right);
        }
        i++;
    }
    return root;
}
// 递归先序打印
void preorderTraversal(Tree *root)
{
    if (root != nullptr)
    {
        cout << root->data << " ";
        preorderTraversal(root->left);
        preorderTraversal(root->right);
    }
}
// 非递归先序打印
void preorderTraversal_no(Tree *root)
{
    if (root == nullptr)
        return;
    stack<Tree *> st;
    st.push(root);
    while (!st.empty())
    {
        Tree *current = st.top();
        cout << current->data << " ";
        st.pop();
        if (current->right != nullptr)
        {
            st.push(current->right);
        }
        if (current->left != nullptr)
        {
            st.push(current->left);
        }
    }
}

int main()
{
    string str;
    while (getline(cin, str))
    {
        if (str == "#")
            break;
        istringstream iss(str);
        int n;
        iss >> n;
        Tree *test = CreateTree(n);
        cout << "非递归\n";
        preorderTraversal_no(test);
        cout << "\n递归\n";
        preorderTraversal(test);
        cout << '\n';
    }

    return 0;
}