题目链接：https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/
难度：简单

描述：
给定一棵二叉搜索树，请找出其中第 k 大的节点的值。

题解

  1. # Definition for a binary tree node.
  2. # class TreeNode:
  3. #     def __init__(self, x):
  4. #         self.val = x
  5. #         self.left = None
  6. #         self.right = None
  8. class Solution:
  9.     def kthLargest(self, root: TreeNode, k: int) -> int:
  10.         nums = []
  11.         def recursion(root):
  12.             if root is None:
  13.                 return
  14.             recursion(root.right)
  15.             nums.append(root.val)
  16.             recursion(root.left)
  18.         recursion(root)
  19.         return nums[k-1]