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

题目链接530.二叉搜索树的最小绝对差

由于是最小二叉树，采用中序遍历的方法，比较上个节点和当前节点的值，得到二叉搜索树的最小绝对差。

class Solution {
    TreeNode pre;//记录上一个节点
    int result = Integer.MAX_VALUE;
    public int getMinimumDifference(TreeNode root) {
        if(root == null){
            return 0;   
        }
        traversal(root);
        return result;
    }
    public void traversal(TreeNode root){
        if(root == null){
            return;
        }
        traversal(root.left);
        if(pre != null){
            result = Math.min(result, root.val - pre.val);
        }
        pre = root;
        traversal(root.right);
    }
}

题目链接501.二叉搜索树中的众数

使用中序遍历的方式，

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

题目链接236.二叉树的最近祖先

使用后序遍历

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