剑指 Offer 54. 二叉搜索树的第k大节点
题目链接:https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof
1.思路
中序遍历的镜像
class Solution {
int count = 0;
int num = 0;
public int kthLargest(TreeNode root, int k) {
search(root,k);
return num;
}
private void search(TreeNode node,int k){
if(node.right!=null) search(node.right,k);
count += 1;
if (count==k) num = node.val;
if (node.left!=null) search(node.left,k);
}
}
优化方向:提取判断count、k是否相等,如果相等,提前结束