Description
Given inorder and postorder traversal of a tree, construct the binary tree.
Note
You may assume that duplicates do not exist in the tree.
Example
For example, given
inorder = [9,3,15,20,7]
postorder = [9,15,7,20,3]
Return the following binary tree:
3
/ \
9 20
/ \
15 7
Solution 1(C++)
/**
* 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) {
return helper(inorder, 0, inorder.size()-1, postorder, 0, postorder.size()-1);
}
TreeNode* helper(vector<int>& inorder, int istart, int iend, vector<int>& postorder, int pstart, int pend){
if(istart>iend||pstart>pend) return nullptr;
int rootvalue=postorder[pend], rootindex;
for(int i=istart; i<=iend; i++){
if(inorder[i]==rootvalue) rootindex=i;
}
int rightNum=iend-rootindex;
TreeNode* root = new TreeNode(rootvalue);
root->right=helper(inorder, rootindex+1, iend, postorder, pend-rightNum, pend-1);
root->left=helper(inorder, istart, rootindex-1, postorder, pstart, pend-rightNum-1);
return root;
}
};
算法分析
一样的思路,参考:LeetCode-105. Construct Binary Tree from Preorder and Inorder Traversal。
程序分析
略