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

530. 二叉搜索树的最小绝对差 - 力扣（LeetCode）

/**
 * 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 {
    public int getMinimumDifference(TreeNode root) {
        List<Integer> list = new ArrayList<>();

        inOrderTraversal(root,list);

        int result = Integer.MAX_VALUE;
        for(int i=1;i<list.size();i++){
            result = Math.min(result,list.get(i)-list.get(i-1));
        }

        return result;
    }

    public void inOrderTraversal(TreeNode root,List<Integer> list){
        if(root == null){
            return;
        }

        inOrderTraversal(root.left,list);
        list.add(root.val);
        inOrderTraversal(root.right,list);
    }
}

501. 二叉搜索树中的众数 - 力扣（LeetCode） 

/**
 * 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 {
    public int[] findMode(TreeNode root) {
        List<Integer> list = new ArrayList<>();

        inOrderTraversal(root,list);
        
        HashMap<Integer,Integer> map = new HashMap<>();
        int max = Integer.MIN_VALUE;
        for(int i=0;i<list.size();i++){
            map.put(list.get(i),map.getOrDefault(list.get(i),0)+1);
            if(map.get(list.get(i)) > max){
                max = map.get(list.get(i));
            }
        }

        int resultSize = 0;
        for (Map.Entry<Integer, Integer> integerIntegerEntry : map.entrySet()) {
            if(integerIntegerEntry.getValue() == max){
                resultSize++;    
            }
        }
        
        int[] result = new int[resultSize];
        int i=0;
        for (Map.Entry<Integer, Integer> integerIntegerEntry : map.entrySet()) {
            if(integerIntegerEntry.getValue() == max){
                result[i++] = integerIntegerEntry.getKey();
            }
        }

        return result;
    }

    public void inOrderTraversal(TreeNode root,List<Integer> list){
        if(root == null){
            return;
        }

        inOrderTraversal(root.left,list);
        list.add(root.val);
        inOrderTraversal(root.right,list);
    }
}

236. 二叉树的最近公共祖先 - 力扣（LeetCode）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Deque<TreeNode>> paths = new ArrayList<>();
    Deque<TreeNode> path = new LinkedList<>();

    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        preOrderTraversal(root,p,q);

        Deque<TreeNode> pPath = paths.get(0);
        Deque<TreeNode> qPath = paths.get(1);
        
        while (pPath.size() >=0 && qPath.size() >=0){
            TreeNode pPop = pPath.pop();
            TreeNode qPop = qPath.pop();

            if(pPop == qPop){
                if(pPath.peek() != qPath.peek()){
                    return pPop;
                }
            }
        }

        return null;
    }
    
    public void preOrderTraversal(TreeNode root,TreeNode p, TreeNode q){
        if(root == null){
            return;
        }
        
        path.add(root);
        if(root.val == p.val){
            paths.add(new LinkedList<>(path));    
        }
        if(root.val == q.val){
            paths.add(new LinkedList<>(path));
        }

        if(root.left!=null){
            preOrderTraversal(root.left,p,q);
            path.removeLast();
        }
        if(root.right!=null){
            preOrderTraversal(root.right,p,q);
            path.removeLast();
        }
    }
}