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

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

核心：搜索二叉树的中序遍历为有序数组！！！

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    List<Integer> list = new LinkedList<>();
    public int getMinimumDifference(TreeNode root) {
        traversal(root);
        int minRes = Integer.MAX_VALUE;
        for (int i = 1; i < list.size(); i++){
            minRes = Math.min(minRes, list.get(i) - list.get(i - 1));
        }
        return minRes;
    }
    public void traversal(TreeNode root) {
        if (root == null) return;
        traversal(root.left);
        list.add(root.val);
        traversal(root.right);
    }
}

501. 二叉搜索树中的众数

关键在于计数！！！

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    List<Integer> resList;
    int maxCount;
    int count;
    TreeNode pre;
    public int[] findMode(TreeNode root) {
        resList = new LinkedList<>();
        count = 0;
        maxCount = 0;
        pre = null;
        traversal(root);
        int[] res = new int[resList.size()];
        for (int i = 0; i < resList.size(); i++) {
            res[i] = resList.get(i);
        }
        return res;
    }
    public void traversal(TreeNode root) {
        if (root == null) return;
        traversal(root.left);

        int rootValue = root.val;

        //进行计数
        if (pre == null || pre.val != root.val) {
            count = 1;
        } else {
            count++;
        }
        //更新最大数目
        if (count > maxCount) {
            resList.clear();
            //更新出现频率最高的元素
            resList.add(rootValue);
            maxCount = count;
        } else if (count == maxCount) {
            //将出现频率相同的元素添加到结果集中
            resList.add(rootValue);
        }
        pre = root;
        traversal(root.right);
    }
}

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

核心：从底向上寻找p和q，回溯回溯！！！

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

        TreeNode left  = lowestCommonAncestor(root.left, p, q);
        TreeNode right = lowestCommonAncestor(root.right, p, q);
        //核心思想为寻找p和q
        if (left == null && right == null) {
            return null;
        } else if (left != null && right == null) {
            return left;
        } else if (left == null && right != null) {
            return right;
        } else {
            return root;
        }
    }
}