题目一:中序遍历+后序遍历
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) {
return dfs(inorder,0,inorder.size()-1,postorder,0,postorder.size()-1);
}
TreeNode *dfs(vector<int> &inorder,int in_left,int in_right,vector<int> &postorder,int post_left,int post_right)
{
if(in_left>in_right)
return NULL;
int mid=in_left;
for(;mid<=in_right;mid++)
{
if(inorder[mid]==postorder[post_right])
break;
}
TreeNode *root=new TreeNode(inorder[mid]);
int in_left_length=mid-in_left;
//对于中序,分成两个部分,分别是[in_left,mid-1]、[mid+1,in_right]
//对于后序,分成两部分,分别是[post_left,post_left+in_left_length-1]、[post_left+in_left_length,post_right-1]
root->left=dfs(inorder,in_left,mid-1,postorder,post_left,post_left+in_left_length-1);//
root->right=dfs(inorder,mid+1,in_right,postorder,post_left+in_left_length,post_right-1);
return root;
}
};
题目二:
Given preorder and inorder 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> &preorder, vector<int> &inorder) {
return dfs(inorder,0,inorder.size()-1,preorder,0,preorder.size()-1);
}
TreeNode *dfs(vector<int> &inorder,int in_left,int in_right,vector<int> &preorder,int pre_left,int pre_right)
{
if(in_left>in_right)
return NULL;
int mid=in_left;
for(;mid<=in_right;mid++)
{
if(inorder[mid]==preorder[pre_left])
break;
}
TreeNode *root=new TreeNode(inorder[mid]);
int in_left_length=mid-in_left;
//对于中序,分成两个部分,分别是[in_left,mid-1]、[mid+1,in_right]
//对于前序,分成两部分,分别是[pre_left+1,pre_left+in_left_length]、[pre_left+in_left_length+1,pre_right]
root->left=dfs(inorder,in_left,mid-1,preorder,pre_left+1,pre_left+in_left_length);//
root->right=dfs(inorder,mid+1,in_right,preorder,pre_left+in_left_length+1,pre_right);
return root;
}
};