问题:
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
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
分析:
这道题和由前序和中序求出这棵树的道理是一样的,只不过根节点在后序排列数组的最后一个而已,详细可以看leetcode 105.
/**
* 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) {
TreeNode* res;
if( postorder.size() == 0 ){//树是空的
return NULL;
}
res = new TreeNode(postorder[postorder.size()-1]);
if( postorder.size() == 1 ){//只剩下一个节点
return res;
}
int index;
for( int i = 0 ; i < inorder.size() ; i++ ){
if( inorder[i] == postorder[postorder.size()-1] ){//找到根节点在中序排序的位置
index = i;
break;
}
}
vector<int> postLeft;
vector<int> postRight;
vector<int> inLeft;
vector<int> inRight;
for( int i = 0 ; i < index ; i++ ){//以找到的下标为界,构建出两个子树的中序和后序遍历
inLeft.push_back( inorder[i] );
postLeft.push_back( postorder[i] );
}
for( int i = index + 1 ; i < inorder.size() ; i++ ){
inRight.push_back(inorder[i]);
postRight.push_back( postorder[i-1] );
}
res->left = buildTree( inLeft , postLeft );//递归求解
res->right = buildTree( inRight , postRight );
return res;
}
};