题目描述
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
示例
例如,给出
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
思路
这题和leetcode105. 从前序与中序遍历序列构造二叉树相似。
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
unordered_map<int, int> myMap;
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
int n = inorder.size();
for (int i = 0; i < n; i++)
myMap[inorder[i]] = i;
return dfs(inorder, postorder, 0, n-1, 0, n-1);
}
TreeNode* dfs(vector<int>& inorder, vector<int>& postorder, int il, int ir, int pl, int pr){
if (il > ir || pl > pr) return nullptr;
int index = myMap[postorder[pr]];
int len = index-il;
int val = postorder[pr];
TreeNode* root = new TreeNode(val);
root->left = dfs(inorder, postorder, il, index-1, pl, pl+len-1);
root->right = dfs(inorder, postorder, index+1, ir, pl+len, pr-1);
return root;
}
};