代码随想录 day20

最新推荐文章于 2024-10-09 22:28:58 发布

乌拉！哒哒哒哒哒

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量74

点赞数 1

分类专栏：代码随想录打卡记录文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/sunke123456789/article/details/136823409

版权

代码随想录打卡记录专栏收录该内容

30 篇文章 0 订阅

订阅专栏

本文介绍了四个与二叉树相关的C++类方法：构造最大二叉树、合并两个二叉树、在二叉搜索树中搜索以及验证二叉搜索树的完整性。

摘要由CSDN通过智能技术生成

654 最大二叉树

class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        return construct(nums, 0, nums.size() - 1);
    }

    TreeNode* construct(vector<int>& nums, int left, int right) {
        if (left > right) {
            return nullptr;
        }
        int best = left;
        for (int i = left + 1; i <= right; ++i) {
            if (nums[i] > nums[best]) {
                best = i;
            }
        }
        TreeNode* node = new TreeNode(nums[best]);
        node->left = construct(nums, left, best - 1);
        node->right = construct(nums, best + 1, right);
        return node;
    }

};

617 合并二叉树

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
       if (t1 == NULL) return t2;
        if (t2 == NULL) return t1;
        queue<TreeNode*> que;
        que.push(t1);
        que.push(t2);
        while(!que.empty()) {
            TreeNode* node1 = que.front(); que.pop();
            TreeNode* node2 = que.front(); que.pop();
            node1->val += node2->val;
            if (node1->left != NULL && node2->left != NULL) {
                que.push(node1->left);
                que.push(node2->left);
            }
            if (node1->right != NULL && node2->right != NULL) {
                que.push(node1->right);
                que.push(node2->right);
            }
            if (node1->left == NULL && node2->left != NULL) {
                node1->left = node2->left;
            }
            if (node1->right == NULL && node2->right != NULL) {
                node1->right = node2->right;
            }
        }
        return t1;

    }
};

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
        if (t1 == NULL) return t2;
        if (t2 == NULL) return t1;
        t1->val += t2->val;                            
        t1->left = mergeTrees(t1->left, t2->left);      
        t1->right = mergeTrees(t1->right, t2->right);   
        return t1;
    }
};

700 二叉树中的搜索

class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        if(root == NULL){
            return root;
        }
        if(root-> val == val){
            return root;
        }
        TreeNode* result = NULL;
        if(val < root->val){
            result = searchBST(root->left,val);
        }
        else{
            result = searchBST(root->right,val);
        }
        return result;
    }
};

98 验证二叉搜索树

class Solution {
private:
    vector<int> vec;
    void traversal(TreeNode* root) {
        if (root == NULL) return;
        traversal(root->left);
        vec.push_back(root->val);
        traversal(root->right);
    }
public:
    bool isValidBST(TreeNode* root) {
        vec.clear(); 
        traversal(root);
        for (int i = 1; i < vec.size(); i++) {
            if (vec[i] <= vec[i - 1]) 
            return false;
        }
        return true;
    }
};