This problem was asked by Dropbox. Given the root to a binary search tree, find the second largest node in the tree.