刷题|剑指 Offer 54. 二叉搜索树的第k大节点_JavaScript

题目描述

剑指 Offer 54. 二叉搜索树的第k大节点

解题思路

1. 遍历二叉树，存储节点到数组
2. 数组节点排序
3. 返回倒数第k个

代码实现

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} k
 * @return {number}
 */
var kthLargest = function(root, k) {
    let res = [];
    let queue = [root];
    while (queue.length) {
        for (let i=0; i< queue.length; i++) {
            let node = queue.shift();
            res.push(node.val);
            if (node.left) queue.push(node.left);
            if (node.right) queue.push(node.right);
        };
    };

    let result = res.sort((a,b) => a-b);
    return result[result.length - k]
};