Problem 110. Balanced Binary Tree.
Problem 111. Min depth of binary tree.
Problem 112. Path Sum.
Problem 113. Path Sum II. It turns out that copying element one by one to a new ArrayList<Integer> is faster than converting a clone of the original one.