题目
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
例如,给出
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
实现
/**
* 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:
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
TreeNode* root = func(inorder, 0, inorder.size() - 1, postorder, 0, postorder.size() - 1);
return root;
}
TreeNode* func(vector<int>& inorder, int instart, int inend, vector<int>& postorder, int poststart, int postend) {
if (instart > inend || poststart > postend) return NULL;
TreeNode* root = new TreeNode(postorder[postend]);
int flag = 0;
for (int i = instart; i <= inend; i++) {
if (inorder[i] == postorder[postend]) {
flag = i;
break;
}
}
TreeNode* left = func(inorder, instart, flag - 1, postorder, poststart, poststart + flag - instart - 1);
TreeNode* right = func(inorder, flag + 1, inend, postorder, poststart + flag - instart, postend - 1);
root->left = left;
root->right = right;
return root;
}
};