day21

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 {
    TreeNode pre = null;
    int result = Integer.MAX_VALUE;
    public int getMinimumDifference(TreeNode root) {
            traversal(root);
            return result;

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

501. 二叉搜索树中的众数

双指针比较相邻两个节点的值是否相等，同时记录出现的频率和最大出现频率。中序遍历二叉搜索树，若count与macCount相等，向集合中插入当前节点的值，若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 {
    TreeNode pre = null;
    int count = 0;
    int maxCount = 0;
    List<Integer> result = new ArrayList<>();

    public int[] findMode(TreeNode root) {
        searchBST(root);
        int[] res = new int[result.size()];
        for (int i = 0; i < result.size(); i++) {
            res[i] = result.get(i);
        }
        return res;
    }
    public void searchBST(TreeNode cur) {
        if (cur == null) {
            return;
        }
        searchBST(cur.left);
        if (pre == null) {   // 第一个节点
            count = 1;
        } else if (pre.val == cur.val) {    // 与前一个节点值相同
            count++;
        } else {    // 与前一个节点值不同
            count = 1;
        }
        pre = cur;
        if (count == maxCount) {
            result.add(pre.val);
        }
        if (count > maxCount) {
            maxCount = count;
            result.clear();
            result.add(pre.val);
        }
        searchBST(cur.right);
    }
}

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

后序遍历

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root == q || root == p || root == null) {
            return root;
        }
        TreeNode left = lowestCommonAncestor(root.left, p, q);
        TreeNode right = lowestCommonAncestor(root.right, p, q);
        if (left != null && right != null) {
            return root;
        }
        if (left != null && right == null) {
            return left;
        } else if (left == null && right != null) {
            return right;
        } else {
            return null;
        }

    }
}