These are the binary search tree problems every placement candidate should be able to solve, from a plain search to the largest valid BST inside a tree. Trees are given in level order with # for a missing child. Decide first whether the question follows one path, needs the sorted order, or needs a range, then check your program against every test.
