654. 最大二叉树 + 617. 合并二叉树 + 700. 二叉搜索树中的搜索 + 98. 验证二叉搜索树

最新推荐文章于 2024-09-29 01:40:35 发布

清蒸GAMMA

最新推荐文章于 2024-09-29 01:40:35 发布

阅读量67

点赞数

文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/Wang_Dechang/article/details/129976972

版权

654. 最大二叉树

/**
 * 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* constructMaximumBinaryTree(vector<int>& nums) {
        TreeNode* root = new TreeNode(0);
        if (nums.size() == 1) {
            root->val = nums[0];
            return root;
        }
        int maxnum = 0 ;
        int flag = 0;
        for(int i = 0 ; i < nums.size() ; i++)
        {
            if(nums[i] > maxnum)
            {
                flag = i;
                maxnum = nums[i];
            }
        }
        root -> val = maxnum;
        if(flag > 0) 
        {
            vector <int> leftnums(nums.begin() , nums.begin() + flag);
            root -> left = constructMaximumBinaryTree(leftnums);
        }
        if(flag < nums.size() - 1)
        {
            vector <int> rightnums(nums.begin() + flag + 1 , nums.end());
            root -> right = constructMaximumBinaryTree(rightnums);
        }
        return root;
    }
};

617. 合并二叉树

/**
 * 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* mergeTrees(TreeNode* root1, TreeNode* root2) {
        if(root1 == NULL) return root2;
        if(root2 == NULL) return root1;
        TreeNode* root = new TreeNode( root1 -> val + root2 -> val);
        if(root1 -> left || root2 ->left) root ->left = mergeTrees(root1 -> left , root2 -> left);
        if(root1 -> right || root2 ->right) root ->right = mergeTrees(root1 -> right , root2 -> right);
        return root;
    }
};

700. 二叉搜索树中的搜索

/**
 * 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* searchBST(TreeNode* root, int val) {
        if(root == NULL) return root;
        if(val > root -> val) return searchBST(root -> right , val);
        else if(val < root -> val ) return searchBST(root -> left , val);
        else return root;
    }
};

98. 验证二叉搜索树

/**
 * 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 * cur = NULL;
    bool isValidBST(TreeNode* root) {
        if(root == NULL )return 1;
        int left = isValidBST(root -> left);
        if(cur != NULL && cur -> val >= root -> val)return 0;
        cur = root;
        int right = isValidBST(root -> right);
        return left && right;
    }
};