题目描述:
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。例如,给出
中序遍历 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) {
return build(inorder, 0, inorder.size()-1, postorder, 0, postorder.size()-1);
}
TreeNode* build(vector<int>&inorder, int ileft, int iright, vector<int>&postorder, int pleft, int pright)
{
if(ileft > iright || pleft>pright)
return NULL;
int i=0;
for(i=ileft; i<=iright; i++)
if(postorder[pright] == inorder[i])
break;
TreeNode * root = new TreeNode(postorder[pright]);
root -> left = build(inorder, ileft, i-1, postorder, pleft, pleft+i-ileft-1);
root -> right= build(inorder, i+1, iright, postorder, pleft+i-ileft ,pright-1);
return root;
}
};