刷题训练day18 | 第六章 二叉树 part07

题目1：【二刷完成】

class Solution {
    TreeNode prenode;
    int result = Integer.MAX_VALUE;
    public int getMinimumDifference(TreeNode root) {
        if (root==null) return 0;
        return minAbs(root,result);
    }
    int minAbs(TreeNode root, int result){
        if (root==null) return result;
        result = minAbs(root.left,result);
        if (prenode!=null){
            result = Math.min(result,Math.abs(prenode.val-root.val));
        }
        prenode = root;
        result = minAbs(root.right,result);
        return result;
    }
}

题目2：【二刷完成】

class Solution {
    ArrayList<Integer> resList;
    int maxCount;
    int count;
    TreeNode preNode;
    public int[] findMode(TreeNode root) {
        resList = new ArrayList<>();
        maxCount = 0;
        count = 0;
        preNode = null;
        findNode(root);
        int[] result = new int[resList.size()];
        if (root==null) return result;
        for(int i=0;i<resList.size();i++){
            result[i] = resList.get(i);
        }
        return result;

    }
    void findNode(TreeNode root){
        if (root==null) return;
        findNode(root.left);
        int rootValue = root.val;
        if (preNode==null || rootValue!=preNode.val){
            count=1;
        }else{
            count++;
        }
        
        if (maxCount==count){
            resList.add(rootValue);
        }else if (maxCount<count){
            resList.clear();//resList.removeAll(resList);这个方法耗时很长
            resList.add(rootValue);
            maxCount = count;
        }
        preNode = root;
        findNode(root.right);
    }
}

题目3：【二刷完成】

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