Given a binary search tree, search for the second largest element.
Resposta da entrevista
Sigiloso
17 de mai. de 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.