Given the root to a binary search tree, find the second largest node in the tree.
Example:
>>> tree = [9, [4, [1, None, None], [7, [5, None, None], None]], [31, [14, None, None], [82, None, None]]]
>>> coding_problem_36(tree)
31
36
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||