Give the minimum height of a binary search tree?
Anonymous
Breadth-first search queuing up child nodes, then keep separate counters to track # of children in each level to help in determining level of tree. Once you hit a node with no children, return the level
Check out your Company Bowl for anonymous work chats.