根据二叉树的中序和后序结果来重构二叉树
1,根据遍历规则可知,后序遍历的最后一个元素即为根节点,在中序遍历数组中找到该根节点
2,该根节点将中序数组分成左右两部分,分别为该根节点的左右子树结点
3,递归执行上述步骤
代码
class Solution
{
public:
TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder)
{
TreeNode *head = NULL;
int inSize = inorder.size();
int postSize = postorder.size();
if(inSize!=postSize||inSize==0)
return head;
return buildTreeHelper(inorder, 0, inSize-1, postorder, 0, postSize-1);
}
TreeNode * buildTreeHelper(vector<int> &inorder,int start0, int end0 ,vector<int> &postorder,int start1, int end1)
{
if(start0>end0||start1>end1)
return NULL;
TreeNode *node = new TreeNode(postorder[end1]);
int leftNum = 0;
int mid;
for(int i = start0; i <= end0; ++i)
{
if(inorder[i]==node->val)
{
mid = i;
break;
}
}
leftNum = mid - start0;
node->left = buildTreeHelper(inorder,start0, mid-1 ,postorder, start1, start1+leftNum-1);
node->right = buildTreeHelper(inorder,mid+1, end0, postorder, start1+leftNum, end1-1);
return node;
}
};