统一算法:递归 + map映射
前两题统一思路:
通过map映射将中序遍历的值与下标构成映射关系,例如mp[value] = index。然后根据中序序列进行构造。
然后通过前序/后序序列地找到中序序列所处位置(利用映射关系),以其为根节点,然后递归地构造左子树与右子树(中序序列中根节点所处位置左边是左子树范围,右边是右子树范围)。
1.从前序与中序遍历序列构造二叉树
/**
* 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:
map<int,int> mp;
vector<int> pre,in;
int id = 0;
TreeNode* dfs(int in_left, int in_right) {
if (in_left > in_right) return nullptr;
TreeNode* root = new TreeNode(pre[id]);
int index = mp[pre[id ++]];
root->left = dfs(in_left,index - 1);
root->right = dfs(index + 1,in_right);
return root;
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
pre = preorder;
in = inorder;
for (int i = 0;i < inorder.size();i ++ ) {
mp[inorder[i]] = i;
}
int n = preorder.size();
return dfs(0,n - 1);
}
};
2. 从中序与后序遍历序列构造二叉树
/**
* 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:
map<int,int> mp;
vector<int> post,in;
int id;
TreeNode* dfs(int in_left, int in_right) {
if (in_left > in_right) return nullptr;
TreeNode* root = new TreeNode(post[id]);
int index = mp[post[id --]];
root->right = dfs(index + 1,in_right);
root->left = dfs(in_left,index - 1);
return root;
}
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
post = postorder;
in = inorder;
for (int i = 0;i < (int)inorder.size();i ++ ) {
mp[inorder[i]] = i;
}
int n = (int)postorder.size();
id = n - 1;
return dfs(0,n - 1);
}
};
3.根据前序和后序遍历构造二叉树
原题链接
最后一题思路:
通过map映射将前序/后序序列的值与下标构成映射关系,例如mp[value] = index。然后根据前序序列或是根据后序序列进行构造。
本题与前两题不相同,由于递归构造是 无法确定是左子树还是右子树 (因为无论根据前序序列或是根据后序序列进行构造,都无法准确知道,这一点不如前两题通过中序序列构造来得准确),故存在多个答案。
但和前中与后中的思路基本一致,依然是根据前序和后序的特点去划分区间、实现递归,用来划分前序遍历的左子树部分与右子树部分,然后就是普通递归即可。
/**
* 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:
map<int,int> mp;
vector<int> pre,post;
int id = 0,id_pre = 0,id_post;
TreeNode* dfs(int post_left, int post_right,int len) {
if (post_left > post_right) return nullptr;
TreeNode* root = new TreeNode(pre[id]);
int root_id = mp[pre[id ++]];
if (post_left == post_right) return root;
int index = mp[pre[id]];
root->left = dfs(post_left,index,len);
root->right = dfs(index + 1,root_id - 1,len);
return root;
}
TreeNode* constructFromPrePost(vector<int>& preorder, vector<int>& postorder) {
pre = preorder;
post = postorder;
int n = pre.size();
for (int i = 0;i < n;i ++ ) mp[post[i]] = i;
return dfs(0,n - 1,n);
}
};