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

 530.二叉搜索树的最小绝对差Minimum Absolute Difference in BST - LeetCode

方法一：中序遍历转成数组，再求最小值

方法二：双指针

int res = Integer.MAX_VALUE;

TreeNode pre = null;

void traversal(TreeNode cur);

左：traversal(root.left)

中：if(pre != null)

                res = min(res, cur.val - pre.val);

        pre = cur;

        traversal(root.right)

右：traversal(cur.right)

/**
 * 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 {
    TreeNode pre;
    int min = Integer.MAX_VALUE;
    public int getMinimumDifference(TreeNode root) {
        if (root == null) return 0;
        traversal(root);
        return min;
    }

    public void traversal(TreeNode cur) {
        if (cur == null) return;
        traversal(cur.left);
        if (pre != null) {
            min = Math.min(min, cur.val - pre.val);
        }
        pre = cur;
        traversal(cur.right);
    }
}

501.二叉搜索树中的众数 Find Mode in Binary Search Tree - LeetCode

TreeNode pre;

int count = 0;//统计单个出现频率

int maxCount = 0;//出现的最高频率

List<> res ;

void traverdal(TreeNode cur)

        if (cur == null) return;

左    traversal(cur.left);

        if(pre == null) count = 1;

        else if (pre == cur.val) count++;

        else count = 1;

        pre = cur;

        if (count == maxCount) res.add(cur.val);

        if (count > maxCount)

                maxCount = count;

                res.clear();

                res.add(cur.val);

        traversal（cur.right)

return;

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

    private void traversal(TreeNode cur) {
        if (cur == null) return;
        traversal(cur.left);
        if (pre == null) {
            count = 1;
        } else if (pre.val == cur.val) {
            count++;
        } else {
            count = 1;
        }
        pre = cur;
        if (count == maxCount) {
            list.add(cur.val);
        }
        if (count > maxCount) {
            maxCount = count;
            list.clear();
            list.add(cur.val);
        }
     //   pre = cur;
        traversal(cur.right);

        return;
    }
}

236. 二叉树的最近公共祖先 Lowest Common Ancestor of a Binary Tree - LeetCode

TreeNode traversal(TreeNode root, p, q)

        if (root == null) return root;

        if (root == p || root == q) return root;

        TreeNode left = traversal(root.left, p, q);

        TreeNode right = traversal(root.right, p, q);

        中 if(left != null && right != null) return root;

        if (left == null && right != null) return right;

        else (left != null && right == null) return left;

        else return null;

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