Amazon interview question
Given a binary search tree, search for the second largest element.
Interview Answer
Anonymous
17 May 2012
Perform an in-order traversal, but for every node, search for the right child first instead of the left child. The second visited node should be the second largest one.
2