首页 > 代码库 > [leetcode] construct-binary-tree-from-inorder-and-postorder-
[leetcode] construct-binary-tree-from-inorder-and-postorder-
题目描述
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:
void ConstructTree(TreeNode *&tree, vector<int> &inorder, int inbegin, int inend, vector<int> &postorder, int postbegin, int postend)
{
if(inbegin > inend || postbegin > postend)
return;
int i;
int mid = postorder[postend];
tree = new TreeNode(mid);
for(i = inbegin; i <= inend; i++)
{
if(inorder[i] == mid)
break;
}
ConstructTree(tree->left, inorder, inbegin, i-1, postorder, postbegin, postbegin+i-1-inbegin);
ConstructTree(tree->right, inorder, i+1, inend, postorder, postbegin+i-inbegin, postend-1);
}
TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder)
{
if(inorder.size() == 0 || postorder.size() == 0)
return NULL;
TreeNode *tree = NULL;
ConstructTree(tree, inorder, 0, inorder.size()-1, postorder, 0, postorder.size()-1);
return tree;
}
};
[leetcode] construct-binary-tree-from-inorder-and-postorder-
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。