代码随想录算法训练Day21| 530.二叉搜索树的最小绝对差 & 501.二叉搜索树中的众数 & 236. 二叉树的最近公共祖先

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

class Solution {
private:
vector<int> vec;
void traversal(TreeNode* root) {
    if (root == nullptr) return;
    traversal(root->left);
    vec.push_back(root->val);
    traversal(root->right);
}
public:
    int getMinimumDifference(TreeNode* root) {
        vec.clear();
        traversal(root);
        if (vec.size() < 2) return 0;
        int result = INT_MAX;
        for (int i = 1; i < vec.size(); i++) {
            result = min(result, vec[i] - vec[i - 1]);
        }
        return result;
    }
};

501.二叉搜索树中的众数

class Solution {
private:
    int maxCount;  // 最大频率
    int count;  //统计频率
    TreeNode* pre;
    vector<int> result;
    void searchBST(TreeNode* cur) {
        if (cur == nullptr) return;
        searchBST(cur->left);  // 左

        if (pre == nullptr) {
            count = 1;
        } else if (pre->val == cur->val) {
            count++;
        } else {  // 与上一个节点数值不同
            count = 1;
        }
        pre = cur;  // 节点更新

        if (count == maxCount) {
            result.push_back(cur->val);
        }

        if (count > maxCount) {
            maxCount = count;
            result.clear();  // 清空之前的result
            result.push_back(cur->val);
        }

        searchBST(cur->right);  // 右
        return;
    }
public:
    vector<int> findMode(TreeNode* root) {
        count, maxCount = 0, 0;
        TreeNode* pre = nullptr;
        result.clear();
        searchBST(root);
        return result;
    }
};

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

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (root == q || root == p || root == NULL) return root;
        TreeNode* left = lowestCommonAncestor(root->left, p, q);
        TreeNode* right = lowestCommonAncestor(root->right, p, q);
        if (left != NULL && right != NULL) return root;
        if (left == NULL) return right;
        return left;
    }
};