思路还是差不多对的,但是其他参数的控制需要考虑清楚
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int res,index = 0;
public int kthLargest(TreeNode root, int k) {
dfs(root,k);
return res;
}
void dfs(TreeNode root, int k){
if(root == null) return ;
dfs(root.right,k);
index++;
if(index == k) res = root.val;
dfs(root.left,k);
}
}