Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
树根是后序遍历的最后一个元素。
/**
* Definition for binary tree
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
assert(inorder.size()==postorder.size());
if(inorder.size()==0) return NULL;
return build(inorder,0,inorder.size()-1,postorder,0,postorder.size()-1);
}
TreeNode *build (vector<int> &inorder, int istart, int iend, vector<int> &postorder, int pstart, int pend)
{
if(istart>iend)
{
return NULL;
}
int root = postorder[pend];
int index;
for(int i=istart;i<=iend;i++)
{
if(inorder[i]==root)
{
index = i;
break;
}
}
int length = index-istart;
TreeNode * leftNode = build(inorder,istart,index-1,postorder,pstart,pstart+length-1); //!!!
TreeNode * rightNode = build(inorder,index+1,iend,postorder,pstart+length,pend-1); //!!!
TreeNode *node = new TreeNode(root);
node->left = leftNode;
node->right = rightNode;
return node;
}
};