Day 17 | 110. Balanced Binary Tree | 257. Binary Tree Paths | 404. Sum of Left Leaves

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

---

LeetCode 110. Balanced Binary Tree

Question Link

class Solution {
    public boolean isBalanced(TreeNode root) {
        return getHeight(root) != -1;
    }

    int getHeight(TreeNode node){
        if(node == null) 
            return 0;
        int leftHeight = getHeight(node.left);
        if(leftHeight == -1)
            return -1;
        int rightHeight = getHeight(node.right);
        if(rightHeight == -1)
            return -1;
        if(Math.abs(leftHeight-rightHeight) > 1)
            return -1;

        return Math.max(leftHeight, rightHeight) + 1;
    }
}

LeetCode 257. Binary Tree Paths

Question Link

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();
        if(root == null)
            return res;
        List<Integer> paths = new ArrayList<>();
        traversal(root, paths, res);  
        return res;  
    }

    void traversal(TreeNode node, List<Integer> paths, List<String> res){
        paths.add(node.val);
        if(node.left == null && node.right == null){
            StringBuilder sb = new StringBuilder();
            for(int i = 0; i < paths.size()-1; i++)
                sb.append(paths.get(i)).append("->");
            sb.append(paths.get(paths.size()-1));
            res.add(sb.toString());
            return;
        }           
        if(node.left != null){
            traversal(node.left, paths, res);
            paths.remove(paths.size() - 1);
        }
        if(node.right != null){
            traversal(node.right, paths, res);
            paths.remove(paths.size() - 1);
        }
    }
}

LeetCode 404. Sum of Left Leaves

Question Link

class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null)
            return 0;    
        return getSum(root);       
    }

    int getSum(TreeNode node){
        if(node == null) return 0;
        if(node.left == null && node.right == null) return 0;

        int leftValue = getSum(node.left);
        int rightValue = getSum(node.right);
        if(node.left!=null && node.left.left == null && node.left.right == null)
            leftValue = node.left.val;
        return leftValue + rightValue;         
    }
}