Write a function that finds and returns the node with the second highest value in a Binary Search Tree. Assume the BST is valid, but not necessarily complete or balanced.
Anonymous
Reverse in order ?
Check out your Company Bowl for anonymous work chats.