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

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

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

class Solution {
    int gap = Integer.MAX_VALUE;
    TreeNode pre;
    public int getMinimumDifference(TreeNode root) {
        travelTree(root);
        return gap;
    }
    public void travelTree(TreeNode node){
        if(node == null) return;
        travelTree(node.left);
        if(pre!=null){
            gap = Math.min(gap,node.val-pre.val);
        }
        pre = node;
        travelTree(node.right);
    }
}

501. 二叉搜索树中的众数

class Solution {
    List<Integer> list = new ArrayList<>();
    int maxSize = 0;
    int count = 0;
    TreeNode pre = null;
    public int[] findMode(TreeNode root) {
        travelTree(root);
        int[] res = new int[list.size()];
        for(int i = 0; i < list.size(); i++){
            res[i] = list.get(i);
        }
        return res;
    }
    public void travelTree(TreeNode node){
        if(node == null) return;
        travelTree(node.left);
        if (pre == null || node.val != pre.val) {
            count = 1;
        } else {
            count++;
        }
        if(count == maxSize){
            list.add(node.val);
        }else if(count > maxSize){
            list.clear();
            list.add(node.val);
            maxSize = count;
        }
        pre = node;
        travelTree(node.right);
    }
}

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

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