Cracking the Coding Interview Chapter 4 Trees and Graphs Problems Route Between Nodes Minimal Tree List of Depths Check Balanced Validate BST Successor Build Order First Common Ancestor BST Sequences Check Subtree Random Node Paths with Sum