/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private static List<Integer> list = new ArrayList<Integer>();
 
    public int kthLargest(TreeNode root, int k) {
        zhongxu(root);
        return list.get(list.size()-k);
    }
 
    public static void zhongxu(TreeNode node){
 
        if(node == null){
            return;
        }
        zhongxu(node.left);
        list.add(node.val);
        zhongxu(node.right);
    }
}