非递归算法对完全二叉树的前序遍历

非递归算法对完全二叉树的前序遍历

代码

# include<iostream>
# include<stack>
using namespace std;
const int m = 100;
struct b
{
    char data;
    int num;
}se[m];
int main()
{
    stack<char>s;
    int n;
    cin>>n;
    for(int i = 0;i < n;i++)
    {
        cin>>se[i].data;
    }
    se[0].num = 0;
    int root = se[0].num;
    s.push(root);
    while(!s.empty())
    {
        root = s.top();
        s.pop();
        cout<<se[root].data<<" ";
        int lc = 2*root+1;
        int rc = 2*root+2;
        if(rc < n)s.push(rc);
        if(lc < n)s.push(lc);
    }
}