530. 二叉搜索树的最小绝对差+ 501. 二叉搜索树中的众数 + 236. 二叉树的最近公共祖先

最新推荐文章于 2024-09-28 10:34:40 发布

清蒸GAMMA

最新推荐文章于 2024-09-28 10:34:40 发布

阅读量71

点赞数

文章标签： leetcode 算法 java

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

版权

530. 二叉搜索树的最小绝对差

/**
 * 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:
    void mysort(TreeNode* root , vector<int>& res)
    {
        if(root == NULL) return;
        mysort(root -> left , res);
        res.push_back(root -> val);
        mysort(root -> right , res);
    }
    int getMinimumDifference(TreeNode* root) {
        vector<int> res;
        mysort(root , res);
        int flag = INT_MAX;
        if(res.size() < 2) return 0;
        for(int i = 0; i < res.size() - 1 ; i++ )
        {
            if((res[i + 1] - res [i]) < flag)
            {
                flag = res[i + 1] - res [i];
            }
        }
        return flag;
    }
};

501. 二叉搜索树中的众数

/**
 * 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:
    int maxcount = 0;
    int count = 0;
    TreeNode* pre = NULL;
    vector<int> res;
    void myfun(TreeNode*cur)
    {
        if(cur == NULL) return;
        myfun(cur -> left);
        if(pre == NULL )
        count = 1;
        else if(pre -> val == cur -> val)
        count++;
        else
        count = 1;

        pre = cur;
        if(count == maxcount)
        res.push_back(cur -> val);
        else if(count > maxcount)
        {
            res.clear();
            maxcount = count;
            res.push_back(cur -> val);
        }        

        myfun(cur -> right);
    }
    vector<int> findMode(TreeNode* root) {
        
        if(root == NULL) return res;
        myfun(root);
        return res;
    }
};

236. 二叉树的最近公共祖先

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL) return NULL;
        if(root == p || root == q) return root;

        TreeNode* left = lowestCommonAncestor(root -> left , p , q);
        TreeNode* right = lowestCommonAncestor(root -> right , p , q);

        if(left!= NULL && right!= NULL) return root;
        else if(left != NULL && right == NULL) return left;
        else return right;
    }
};