先中序
解题思路: 二叉树的前序遍历:根左右;中序遍历:左根右 由前序遍历知道根节点之后,能在中序遍历上划分出左子树和右子树。分别对中序遍历的左右子树递归进行这一过程即可建树。
图解:
/**
* 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* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
if(!pre.size()) return NULL;
TreeNode* root = new TreeNode(pre[0]);
int k;
for(int i = 0;i < vin.size();++i)
if(vin[i] == pre[0]){
k = i;break;
}
root->left = reConstructBinaryTree(vector<int>(pre.begin()+1,pre.begin()+k+1), vector<int>(vin.begin(),vin.begin()+k));
root->right = reConstructBinaryTree(vector<int>(pre.begin()+k+1,pre.end()), vector<int>(vin.begin()+k+1,vin.end()));
return root;
}
};
中后序
根据一棵树的中序遍历与后序遍历构造二叉树。
注意:
你可以假设树中没有重复的元素。
例如,给出
中序遍历 inorder = [9,3,15,20,7]
后序遍历 postorder = [9,15,7,20,3]
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
if(!postorder.size())return nullptr;
int n = postorder.size();
TreeNode* root = new TreeNode(postorder[n-1]);
int k;
for(int i = 0;i < inorder.size();++i)
if(inorder[i] == postorder[n-1]){
k = i;break;
}
vector<int> inorderleft(inorder.begin(),inorder.begin()+k);
vector<int> inorderright(inorder.begin()+k+1,inorder.end());
vector<int> postorderleft(postorder.begin(),postorder.begin()+k);
vector<int> postorderright(postorder.begin()+k,postorder.end()-1);
root->left = buildTree(inorderleft,postorderleft);
root->right = buildTree(inorderright,postorderright);
return root;
}
};