LeetCode:Kth Smallest Element in a BST

原创 2016年06月01日 15:41:06

Kth Smallest Element in a BST




Total Accepted: 49142 Total Submissions: 128501 Difficulty: Medium

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).

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags
 Binary Search Tree
Hide Similar Problems
 (M) Binary Tree Inorder Traversal





























java code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int kthSmallest(TreeNode root, int k) {
        
        int count = countNode(root.left);
        
        if(k == count + 1)
            return root.val;
        else if(k < count + 1)
            return kthSmallest(root.left, k);
        else // k > count + 1
            return kthSmallest(root.right, k - count - 1);
            
    }
    
    // 自定义函数:计算树中结点个数
    int countNode(TreeNode root) {
        if(root == null) return 0;
        
        return countNode(root.left) + countNode(root.right) + 1;
    }
    
}

版权声明:本文为博主原创文章,转载请注明出处。

相关文章推荐

leetcode-230-Kth Smallest Element in a BST

Kth Smallest Element in a BST   Given a binary search tree, write a function kthSmallest to ...

[leetcode] Kth Smallest Element in a BST

题目链接在此 Given a binary search tree, write a function kthSmallest to find the kth smallest elemen...

leetcode 230. Kth Smallest Element in a BST-递归|非递归

原题链接:230. Kth Smallest Element in a BST 【思路-Java、Python】——递归实现 我们知道二分查找数(BST)的性质——任何一个节点的值均大于左子树的任意节...

<LeetCode OJ> 230. Kth Smallest Element in a BST

230. Kth Smallest Element in a BST My Submissions Question Total Accepted: 32753 Total Submissio...

【LEETCODE】230-Kth Smallest Element in a BST

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

LeetCode - 230. Kth Smallest Element in a BST

这道题目需要利用BST的性质,就是如果对BST进行中序遍历的话,得到的序列的一定是sorted,所以一开始使用了一个ArrayList存储访问的元素,然后返回第k - 1个。但是这种方法不太好,更好的...

Leetcode 230. Kth Smallest Element in a BST (Medium) (cpp)

Leetcode 230. Kth Smallest Element in a BST (Medium) (cpp)
  • Niko_Ke
  • Niko_Ke
  • 2016年08月23日 11:17
  • 278

LeetCode 230. Kth Smallest Element in a BST 解题报告

LeetCode 230. Kth Smallest Element in a BST 解题报告

Kth Smallest Element in a BST - leetcode 230号题目个人题解

Kth Smallest Element in a BST - leetcode 230号题目个人题解题目要求Given a binary search tree, write a function ...

【leetcode】230. Kth Smallest Element in a BST

一、题目描述 Given a binary search tree, write a function kthSmallest to find the kth smallest elem...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode:Kth Smallest Element in a BST
举报原因:
原因补充:

(最多只允许输入30个字)