/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private int res, k;
public void dfs(TreeNode root) {
if (root == null) {
return;
}
dfs(root.right);
if (--k == 0) {
res = root.val;
return;
}
dfs(root.left);
}
public int kthLargest(TreeNode root, int k) {
this.k = k;
dfs(root);
return res;
}
}