思路:递归进行对应子树的分割,类似中序和前序构造二叉树
代码:
class Solution {
public:
TreeNode* helper(vector<int>& values)
{
if(values.size() == 0) return nullptr;
vector<int> cur = values;
sort(cur.begin(),cur.end());
int rootvalue = cur[cur.size() - 1];
TreeNode* root = new TreeNode(rootvalue);
int deleteidx;
for(deleteidx = 0;deleteidx < values.size();deleteidx++)
{
if(values[deleteidx] == rootvalue) break;
}
//切割
vector<int> leftmax(values.begin(),values.begin() + deleteidx);
vector<int> rightmax(values.begin() + deleteidx + 1,values.end());
root->left = helper(leftmax);
root->right = helper(rightmax);
return root;
}
TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
if(nums.size() == 0) return nullptr;
return helper(nums);
}
};
思路:类似二分查找,比较当前节点和val,若是当前节点更大就往左去找,否则就往右,cur存储的就是遍历的子树节点
代码:
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
if(root == nullptr) return nullptr;
TreeNode* cur = root;
while(cur != nullptr)
{
if(cur->val < val)
{
cur = cur->right;
}
else if(cur->val > val)
{
cur = cur->left;
}
else break;
}
return cur;
}
};
思路:主要是何时递归,以及当有节点为null的时候的处理。前序中序和后序都可以
代码:
class Solution {
public:
TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
if(root1 == nullptr) return root2;
if(root2 == nullptr) return root1;
//前序
root1->val += root2->val;//在root1上操作
root1->left = mergeTrees(root1->left,root2->left);//递归对左右子树进行加法
root1->right = mergeTrees(root1->right,root2->right);
return root1;
/*中序
//root1->left = mergeTrees(root1->left,root2->left);
//root1->val += root2->val;
//root1->right = mergeTrees(root1->right,root2->right);
//后序
//root1->left = mergeTrees(root1->left,root2->left);
//root1->right = mergeTrees(root1->right,root2->right);
//root1->val += root2->val;
*/
}
};
思路:由于二叉搜索树左边的都比右边的小,然后转化为有序数组后,除去根节点,其他的数都是从小到大排列
代码:
class Solution {
vector<int> vec;
public:
void verse(TreeNode* root)
{
if(root == nullptr) return;
verse(root->left);
vec.push_back(root->val);
verse(root->right);
}
bool isValidBST(TreeNode* root) {
verse(root);
for(int i = 1;i < vec.size();i++)
{
if(vec[i] <= vec[i - 1]) return false;
}
return true;
}
};