已知二叉树的中序遍历和前序遍历，如何求后序遍历

最新推荐文章于 2022-06-05 22:29:04 发布

渡人先渡己

最新推荐文章于 2022-06-05 22:29:04 发布

阅读量490

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/qiuyoujie/article/details/79125761

版权

算法专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#include <iostream>

using namespace std;



void BinaryTreeFromOrderHelper(string InOrder,string PreOrder,int length, string&res)
{
    if(length == 0)  
    {  
       return;  
    }  
    char val = PreOrder[0];
    int rootIndex = 0;
    for(;rootIndex < length; rootIndex++)
    {
        if(InOrder[rootIndex] == val)
            break;
    }
    BinaryTreeFromOrderHelper(InOrder,PreOrder.substr(1), rootIndex, res);
    BinaryTreeFromOrderHelper(InOrder.substr(rootIndex+1), PreOrder.substr(rootIndex+1), length-(rootIndex+1),res);
    res+=val;

}

string PostOrder(string InOrder, string PreOrder)
{
    string res;
    BinaryTreeFromOrderHelper(InOrder, PreOrder, InOrder.length(), res);
    return res;
}


int main() {

    cout<<PostOrder("ADEFGHMZ","GDAFEMHZ ");  //AEFDHZMG
    return 0;
}

思路：
1,figure out the root, then find the left subtree and right subtree
2,recurse in the left subtree
3,recurse int he right subtree
4,print out the root

//中序遍历和后序遍历求前序遍历

//已知前序和后序能确定中序吗？