These are the binary tree problems every placement candidate should be able to solve, from counting nodes to the lowest common ancestor and the best route. Each problem gives the tree in level order with null for a missing child. Pick the tool first: a recursion, a deque or a stack. Trace a small tree on paper, then check your program against every test.
