← 返回 uber 的题目列表Kth Largest Element in a BST
类型：online_judge
Given a Binary Search Tree (BST), your task is to return the Kth largest element. You are required to generate the BST yourself.
For example, given the BST of the following structure:
5
/ \
3 8
/ \ / \
1 4 7 10
If K=3, then the Kth largest element is 7.
Example
Input
[[1, 5], [3, 7]]