目录
654 最大二叉树
class Solution {
public:
TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
if(nums.size() == 1){
TreeNode* node = new TreeNode(nums[0]);
return node;
}
int maxVal = 0;
int index = 0;
for(int i = 0; i < nums.size(); i++){
if(nums[i] > maxVal){
maxVal = nums[i];
index = i;
}
}
TreeNode* newNode = new TreeNode(maxVal);
if(index > 0){
vector<int> vleft(nums.begin(), nums.begin() + index);
newNode->left = constructMaximumBinaryTree(vleft);
}
if(index < nums.size() - 1){
vector<int> vright(nums.begin() + index + 1, nums.end());
newNode->right = constructMaximumBinaryTree(vright);
}
return newNode;
}
};
617 合并二叉树
class Solution {
public:
TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
if(root1 == NULL && root2 == NULL){
return NULL;
}
TreeNode* newNode = new TreeNode();
if(root1 != NULL && root2 != NULL){
newNode->val = root1->val + root2->val;
newNode->left = mergeTrees(root1->left, root2->left);
newNode->right = mergeTrees(root1->right, root2->right);
}
if(root1 == NULL && root2 != NULL){
newNode->val = root2->val;
newNode->left = mergeTrees(NULL, root2->left);
newNode->right = mergeTrees(NULL, root2->right);
}
if(root1 != NULL && root2 == NULL){
newNode->val = root1->val;
newNode->left = mergeTrees(root1->left, NULL);
newNode->right = mergeTrees(root1->right, NULL);
}
return newNode;
}
};
700 二叉搜索树中的搜索
class Solution {
public:
TreeNode* find(TreeNode* root, int val, TreeNode* &resultNode){
//中
if(resultNode != NULL) return resultNode;
if(root == NULL) return NULL;
if(root->val == val){
resultNode = root;
}
resultNode = find(root->left, val, resultNode);
resultNode = find(root->right, val, resultNode);
return resultNode;
}
TreeNode* searchBST(TreeNode* root, int val) {
//先序遍历
if(root == NULL) return NULL;
TreeNode* node = NULL;
return find(root, val, node);
}
};
98 验证二叉搜索树
class Solution {
public:
TreeNode* preNode = NULL;
bool isValidBST(TreeNode* root) {
if(root == NULL) return true;
bool left = isValidBST(root->left);
if(preNode != NULL && preNode->val >= root->val){
return false;
}
preNode = root;
bool right = isValidBST(root->right);
return left && right;
}
};