根据中序遍历和后序遍历树构造二叉树
样例
给出树的中序遍历: [1,2,3] 和后序遍历: [1,3,2]
返回如下的树:
2
/ \
1 3
注意
你可以假设树中不存在相同数值的节点
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
/**
*@param inorder : A list of integers that inorder traversal of a tree
*@param postorder : A list of integers that postorder traversal of a tree
*@return : Root of a tree
*/
public:
TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) {
// write your code here
int n = inorder.size();
if (n < 1)
{
return NULL;
}
return visit(inorder, 0, n-1, postorder, 0, n-1);
}
private:
TreeNode* visit(vector<int> &inorder, int left1, int right1,
vector<int> &postorder, int left2, int right2)
{
if (left1 > right1)
{
return NULL;
}
if (left1 == right1)
{
return new TreeNode(inorder[left1]);
}
TreeNode *root = new TreeNode(postorder[right2]);
int i = left1;
for (; i <= right1; i++)
{
if (postorder[right2] == inorder[i])
{
break;
}
}
root->left = visit(inorder, left1, i-1, postorder, left2, left2+i-1-left1);
root->right = visit(inorder, i+1, right1, postorder, left2+i-left1, right2-1);
return root;
}
};