[LeetCode][JavaScript]Kth Smallest Element in a BST

Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

Note: 
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.

Follow up:

What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How would you optimize the kthSmallest routine?

Hint:

1. Try to utilize the property of a BST.
2. What if you could modify the BST node's structure?
3. The optimal runtime complexity is O(height of BST).

https://leetcode.com/problems/kth-smallest-element-in-a-bst/

 

 

---

 

 

这题信息量好大，先是最简单粗暴的解法。

二叉搜索树的特性，先序遍历的输出就是排序的结果。

/**
 * 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 kthSmallest = function(root, k) {
    var count = 0;
    var isFound = false;
    var res = null;
    inorder(root);
    return res;

    function inorder(node){
        if(node !== null && !isFound){
            inorder(node.left);
            count++;
            if(count === k){
                res = node.val;
                isFound = true;
                return;
            }
            inorder(node.right);
        }
    }
};