Day 21 | 530. Minimum Absolute Difference in BST | 501. Find Mode in Binary Search Tree | 236. Lowes

Day 1 | 704. Binary Search | 27. Remove Element | 35. Search Insert Position | 34. First and Last Position of Element in Sorted Array
Day 2 | 977. Squares of a Sorted Array | 209. Minimum Size Subarray Sum | 59. Spiral Matrix II
Day 3 | 203. Remove Linked List Elements | 707. Design Linked List | 206. Reverse Linked List
Day 4 | 24. Swap Nodes in Pairs| 19. Remove Nth Node From End of List| 160.Intersection of Two Lists
Day 6 | 242. Valid Anagram | 349. Intersection of Two Arrays | 202. Happy Numbe | 1. Two Sum
Day 7 | 454. 4Sum II | 383. Ransom Note | 15. 3Sum | 18. 4Sum
Day 8 | 344. Reverse String | 541. Reverse String II | 替换空格 | 151.Reverse Words in a String | 左旋转字符串
Day 9 | 28. Find the Index of the First Occurrence in a String | 459. Repeated Substring Pattern
Day 10 | 232. Implement Queue using Stacks | 225. Implement Stack using Queue
Day 11 | 20. Valid Parentheses | 1047. Remove All Adjacent Duplicates In String | 150. Evaluate RPN
Day 13 | 239. Sliding Window Maximum | 347. Top K Frequent Elements
Day 14 | 144.Binary Tree Preorder Traversal | 94.Binary Tree Inorder Traversal| 145.Binary Tree Postorder Traversal
Day 15 | 102. Binary Tree Level Order Traversal | 226. Invert Binary Tree | 101. Symmetric Tree
Day 16 | 104.MaximumDepth of BinaryTree| 111.MinimumDepth of BinaryTree| 222.CountComplete TreeNodes
Day 17 | 110. Balanced Binary Tree | 257. Binary Tree Paths | 404. Sum of Left Leaves
Day 18 | 513. Find Bottom Left Tree Value | 112. Path Sum | 105&106. Construct Binary Tree
Day 20 | 654. Maximum Binary Tree | 617. Merge Two Binary Trees | 700.Search in a Binary Search Tree

---

LeetCode 530. Minimum Absolute Difference in BST

Question Link

class Solution {
    TreeNode pre; // record the previous node
    int result = Integer.MAX_VALUE;
    public int getMinimumDifference(TreeNode root) {
        traversal(root);
        return result;
    }   

    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);
    }
}

LeetCode 501. Find Mode in Binary Search Tree

Question Link

class Solution {
    TreeNode pre;
    int maxCount = 0;
    int count = 0;
    List<Integer> result = new ArrayList<>();

    public int[] findMode(TreeNode root) {
        traversal(root);
        int[] res = new int[result.size()];
        for(int i = 0; i < result.size(); i++)
            res[i] = result.get(i);
        
        return res;
    }
    
    void traversal(TreeNode node){
        if(node == null) return;
        
        traversal(node.left);

        // Count
        if(pre == null || node.val != pre.val)
            count = 1;
        else
            count++;

        // Update result and maxCount
        if(count == maxCount)
            result.add(node.val);
        if(count > maxCount){
            maxCount = count;
            result.clear();
            result.add(node.val);
        }
        // Move the pointer
        pre = node;

        traversal(node.right);
    }
}

LeetCode 236. Lowest Common Ancestor of a Binary Tree

Question Link

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;   //   Found two nodes
    }
}

• The postorder traversal is a natural backtracking process. It could handle the logic of the middle node by the return value of the left and right subtree.