# leetcode 230: Kth Smallest Element in a BST

8605人阅读 评论(1)

### Kth Smallest Element in a BST

Total Accepted: 3655 Total Submissions: 12149

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

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

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?

[思路]

Follow up 挺有意思, 需要在节点中保留一些额外的信息: 左子树的大小. 在插入删除时也要同时维护左子树的大小. 再查找时,可以用二分. 时间复杂度为O(h)

[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) {
Stack<TreeNode> stack = new Stack<>();
TreeNode n = root;
while(n.left!=null) {
stack.push(n);
n = n.left;
}

while(k>0 && (n!=null || !stack.isEmpty())) {
if(n==null) {
n = stack.pop();
if(--k==0) return n.val;
n = n.right;
} else {
stack.push(n);
n = n.left;
}
}
return n.val;
}
}

1
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：751669次
• 积分：10067
• 等级：
• 排名：第1699名
• 原创：276篇
• 转载：9篇
• 译文：0篇
• 评论：102条
文章分类
阅读排行
最新评论