Daily Coding Problem: Problem #36 [MEDIUM] Good morning! Here's your coding interview problem for today. This problem was asked by Dropbox. Given the root to a binary search tree, find the second largest node in the tree.
