做这个题之前推荐大家去看浙大柳婼的一遍博客:二叉树已知中序后序遍历重构二叉树
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
例如,给出:
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
class Solution {
public:
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
return preorder( 0, inorder.size()-1, inorder, 0, postorder.size()-1, postorder );
}
TreeNode *preorder(int leftin, int rightin, vector<int> in, int leftpost, int rightpost, vector<int> post){
if(leftin > rightin) return NULL;
TreeNode *root = new TreeNode(post[rightpost]);
int i = leftin;
while(i <= rightin && in[i] != post[rightpost]) i++;
int rleft = i - leftin;
root->left = preorder(leftin, i - 1, in, leftpost, leftpost + rleft - 1, post);
root->right = preorder(i + 1, rightin, in, leftpost + rleft , rightpost - 1, post);
return root;
}
};