代码随想录算法训练营第18天 | 第六章 二叉树part06

---

今日记录

---

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

Leetcode链接

关于二叉搜索树：都可以转换为有序数组后对数组进行处理；

处理代码：

    vector<int> vec;
    void traversal(TreeNode* root) {
        if (root == NULL)
            return;
        traversal(root->left);
        vec.push_back(root->val);
        traversal(root->right);
    }

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:
    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.二叉搜索树中的众数

Leetcode链接

class Solution {
private:
    int maxCount = 0; // 最大频率
    int count = 0;
    TreeNode* pre = NULL;
    vector<int> result;

    void searchBTS(TreeNode* cur) {
        if (cur == NULL)
            return;
        //中序遍历：左中右
        searchBTS(cur->left);
        //中间的判决
        if (pre == NULL) {
            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.push_back(cur->val);
        }
        //
        searchBTS(cur->right);
        return;
    }

public:
    vector<int> findMode(TreeNode* root) {
        count = 0;
        maxCount = 0;
        pre = NULL;
        result.clear();
        searchBTS(root);
        return result;
    }
};

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

Leetcode链接

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 right;
        else if (left != NULL && right == NULL)
            return left;
        else
            return NULL;
    }
};

---

总结