二叉树遍历--非递归

最新推荐文章于 2023-11-23 16:27:14 发布

原创最新推荐文章于 2023-11-23 16:27:14 发布 · 897 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#null #bt

二叉树专栏收录该内容

1 篇文章

订阅专栏

void BT_PostOrderNoRec(pTreeT root);

void BT_PostOrderNoRec(pTreeT root)
{
    stack<treeT *> s;
    pTreeT pre = NULL;
    pTreeT top = NULL;

    while ((NULL != root) || !s.empty())
    {
        if (NULL != root)
        {
            s.push(root);
            root = root->left;
        }
        else
        {
            top = s.top();
            if(top->right != NULL && top->right != pre)
                root = top->right;
            else
            {
                visit(top);
                pre = top;
                s.pop();
            }
        }
    }
}

void BT_PreOrderNoRec(pTreeT root);

void BT_PreOrderNoRec(pTreeT root)
{
    stack<treeT *> s;

    while ((NULL != root) || !s.empty())
    {
        if (NULL != root)
        {
            visit(root);
            s.push(root);
            root = root->left;
        }
        else
        {
            root = s.top();
            s.pop();
            root = root->right;
        }
    }
}

void BT_InOrderNoRec(pTreeT root);

void BT_InOrderNoRec(pTreeT root)
{
    stack<treeT *> s;
    while ((NULL != root) || !s.empty())
    {
        if (NULL != root)
        {
            s.push(root);
            root = root->left;
        }
        else
        {
            root = s.top();
            visit(root);
            s.pop();
            root = root->right;
        }
    }
}