Leetcode 102 & 106
分别根据一棵二叉树的inorder和preorder、inorder和postorder构造该二叉树。
pre & in
算法
根据前序的root,在中序中找到该root的位置,该位置左部分为原树的左子树,右部分为原树的右子树。然后在左右两部分中进行相同的操作。只需注意左部分的根,按照给定前序依次遍历就好,右部分的根要在给定的前序中跳过左部分。
code
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) {
if(preorder.size()==0)
return NULL;
map<int, int> in;
for (int i = 0; i < inorder.size(); i++) in.insert(pair<int, int>(inorder[i], i));
TreeNode *root = NULL;
buildrecursion(preorder, in, 0, 0, preorder.size() - 1, root);
return root;
}
void buildrecursion(vector<int>& preorder, map<int,int>& in, int nowpos,
int startpos, int endpos, TreeNode* &root){
int rootpos = in[preorder[nowpos]];
if(startpos>endpos) return;
root = new TreeNode(preorder[nowpos]);
buildrecursion(preorder, in, nowpos + 1, startpos, rootpos - 1, root->left);
buildrecursion(preorder, in, nowpos + rootpos - startpos + 1, rootpos + 1, endpos, root->right);
}
};
post & in
算法
和根据前序与中序的基本相同,只不过post要从后面遍历过来,同时找左子树的根时,在给定的后序中要跳过右子树的部分。
code
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) {
if(inorder.size()==0) return NULL;
map<int, int> in;
for (int i = 0; i < inorder.size(); i++) in.insert(pair<int, int>(inorder[i], i));
TreeNode *root = NULL;
buildrecursion(postorder, in, postorder.size() - 1, 0, postorder.size() - 1, root);
return root;
}
void buildrecursion(vector<int>& postorder, map<int,int>& in, int nowpos,
int startpos, int endpos, TreeNode* &root){
int rootpos = in[postorder[nowpos]];
if(startpos>endpos) return;
root = new TreeNode(postorder[nowpos]);
buildrecursion(postorder, in, nowpos - 1, rootpos + 1, endpos, root->right);
buildrecursion(postorder, in, nowpos - (endpos - rootpos + 1), startpos, rootpos - 1, root->left);
}
};
时间复杂度
两种情况下的时间复杂度都是 O(n),n为二叉树的节点数。