核心解题思路是将大问题分解为小问题,使用递归
遇到这类题思路:确定根 左孩子 右孩子的位置或区间,限定当区间左侧>右侧时返回nullptr
其中中序中的各结点的位置用哈希表存储,用于确定左右孩子区间(结合根节点的值查找后)
105 Construct Binary Tree from Preorder and Inorder Traversal【默写】
题解思路:
/**
* 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* buildTreeHelper(vector<int>& preorder,int preStart,int preEnd, vector<int>& inorder,int inStart ,int inEnd,unordered_map<int,int>& inMap){
if(preStart > preEnd || inStart > inEnd){
return nullptr;
}
//确定根节点的值
int rootVal = preorder[preStart];
//查找根在inorder中的位置使用哈希表
int inRoot = inMap[rootVal];
//确定左孩子区间的大小
int leftnums = inRoot - inStart;
//创立root根节点
TreeNode* root = new TreeNode(rootVal);
root->left = buildTreeHelper(preorder , preStart+1 , preStart+leftnums,inorder,inStart,inRoot-1,inMap);
root->right = buildTreeHelper(preorder , preStart + leftnums + 1, preEnd , inorder , inRoot+1,inEnd,inMap);
return root;
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
//确定左右孩子的区间范围,结合inorder和hash
unordered_map<int,int> inMap;
for(int i=0;i < inorder.size() ;i++){
inMap[inorder[i]] = i;
}
return buildTreeHelper(preorder, 0 ,preorder.size() - 1,inorder,0,inorder.size()-1,inMap);
}
};
106 Construct Binary Tree from Inorder and Postorder Traversal【上一题的类题】
中序+后序–>树
/**
* 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* buildTreeHelper(vector<int>& inorder, int inStart,int inEnd,vector<int>& postorder,int postStart,int postEnd,unordered_map<int,int>& inMap){
//防止溢出
if(inStart > inEnd || postStart > postEnd){
return nullptr;
}
//确定根节点
int rootVal = postorder[postEnd];
TreeNode* root = new TreeNode(rootVal);
//确定左区间范围
int inRoot = inMap[rootVal];
int leftNums = inRoot - inStart;
root->left = buildTreeHelper(inorder , inStart , inRoot-1 , postorder , postStart , postStart+leftNums-1, inMap);
root->right = buildTreeHelper(inorder , inRoot+1 , inEnd , postorder , postStart+leftNums , postEnd-1 , inMap);
return root;
}
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
//中序 后序构建二叉🌳
//用上一题同种思路解决这道题
unordered_map<int,int> inMap;
for(int i = 0 ; i < inorder.size();i++){
inMap[inorder[i]] = i;
}
return buildTreeHelper(inorder,0,inorder.size()-1,postorder,0,postorder.size()-1,inMap);
}
};