René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"腾讯\u0026leetcode230：二叉搜索树中第K小的元素","articleBody":"给定一个二叉搜索树，编写一个函数 `kthSmallest` 来查找其中第 `k` 个最小的元素。\r\n\r\n**说明：**\r\n你可以假设 k 总是有效的，1 ≤ k ≤ 二叉搜索树元素个数。\r\n\r\n**示例 1:**\r\n\r\n```js\r\n输入: root = [3,1,4,null,2], k = 1\r\n   3\r\n  / \\\r\n 1   4\r\n  \\\r\n   2\r\n输出: 1\r\n```\r\n\r\n**示例 2:**\r\n\r\n```js\r\n输入: root = [5,3,6,2,4,null,null,1], k = 3\r\n       5\r\n      / \\\r\n     3   6\r\n    / \\\r\n   2   4\r\n  /\r\n 1\r\n输出: 3\r\n```\r\n\r\n**进阶：**\r\n如果二叉搜索树经常被修改（插入/删除操作）并且你需要频繁地查找第 k 小的值，你将如何优化 kthSmallest 函数？\r\n\r\n附赠leetcode地址：[leetcode](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/solution/teng-xun-leetcode230er-cha-sou-suo-shu-zhong-di-kx/)","author":{"url":"https://github.com/sisterAn","@type":"Person","name":"sisterAn"},"datePublished":"2020-07-21T00:08:00.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":4},"url":"https://github.com/86/JavaScript-Algorithms/issues/86"}