Binary tree find 2nd smallest

Advertisement

Binary tree find 2nd smallest
Hi,
What's a good approach to find the second smallest element in a tree given its root? find2ndSmallest(BinaryTreeNode root). root.left, root.right, root.element thanks!
Repaly
What?
Read More: The other 2 answers