代码随想录算法训练营Day18|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 {
    int res = Integer.MAX_VALUE;
    TreeNode pre = null;
    public int getMinimumDifference(TreeNode root) {
        fun(root);
        return res;
    }

    public void fun(TreeNode root){
        if(root == null) return;
        
        fun(root.left);
        if(pre != null ){
            int temp = root.val - pre.val;
            res = (temp < res)? temp : res;
        }
        pre = root ;
        fun(root.right);

    }

    
}

501.二叉搜索树中的众数

        思路：定义一个maxcount，如果count > maxcount，更新maxcount，并且把元素值加入数组；如果count == maxcount， 把元素加入数组。

/**
 * 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 {
    int count=0;
    int maxCount = 0;
    TreeNode pre = null;
    ArrayList< Integer> resList = new ArrayList<>(); 
    public int[] findMode(TreeNode root) {
        fun(root);
        int[] res = new int[resList.size()];
        //System.out.println(resList);
        for(int i =0; i<resList.size(); i++){
            res[i] = resList.get(i);
        }
        return res;
    }

    public void fun(TreeNode cur){
        if(cur == null) return;
        fun(cur.left);
        if(pre == null || pre.val != cur.val) {
            count = 1;
            }
        else{
            count++;
            }

        if(count == maxCount){
            resList.add(cur.val);

        }else if(count > maxCount){
            resList.clear();
            resList.add(cur.val);
            maxCount = count;
        }
        pre = cur;
        fun(cur.right);
    }
}

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

        思路：自底向上，要回溯。用后序遍历，因为需要收集左右子树的结果，然后返回。

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

    }
}