剑指Offer54.二叉搜索树的第k大节点(javascript)

一、题目地址

https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/

二、具体代码

/*** Definition for a binary tree node.* function TreeNode(val) {* this.val &＃61; val;* this.left &＃61; this.right &＃61; null;* }*/
/*** &＃64;param {TreeNode} root* &＃64;param {number} k* &＃64;return {number}*/
// 时间复杂度: O(n)
// 空间复杂度: O(n)
let result;
var kthLargest &＃61; function(root, k) {// 这一步不能省&＃xff0c;k的值不能改变this.k &＃61; k;dfs(root);return result;
};function dfs(root) {// 终止条件,提前结束递归if(root &＃61;&＃61;&＃61; null || this.k &＃61;&＃61; 0) {return;}dfs(root.right);// 关键条件if(--this.k &＃61;&＃61;&＃61; 0) {result &＃61; root.val;}dfs(root.left);
}


三、补充链接

https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/solution/mian-shi-ti-54-er-cha-sou-suo-shu-de-di-k-da-jie-d/

四、补充部分

关注公众号&＃xff1a;【深漂程序员小庄】&＃xff1a;
内含丰富的学习资源和面试经验&＃xff08;不限前端、java&＃xff09;&＃xff0c;还有学习交流群可加&＃xff0c;并且还有各大厂大佬可一起交流学习&＃xff0c;一起进步&＃xff5e;添加小庄微信&＃xff0c;回复【加群】&＃xff0c;可加入互联网技术交流群&＃xff1a;