We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Given the root to a binary search tree, find the second largest node in the tree.