给定一棵二叉搜索树,请找出其中第k大的节点。
方法一:遍历二叉树放入数组中
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
ArrayList<Integer> array = new ArrayList<>();
public int kthLargest(TreeNode root, int k) {
search(root);
return array.get(array.size() - k);
}
public void search(TreeNode root){
if(root.left != null) search(root.left);
array.add(root.val);
if(root.right != null) search(root.right);
}
}