题目链接:https://leetcode.com/problems/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:
- Try to utilize the property of a BST.
- What if you could modify the BST node's structure?
- The optimal runtime complexity is O(height of BST).
思路:要找第k个数,中序遍历二叉树, 直到找到第k个
如果要频繁查找的话可以在数据结构中添加一个字段,记录左节点有多少个。这样最多只要O(h)的时间复杂度。
我第一个代码运行速度居然超越了100%的代码,amazing!
代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int kthSmallest(TreeNode* root, int k) {
if(!root || cur > k) return ans;
kthSmallest(root->left, k);
cur++;
if(cur == k) ans = root->val;
kthSmallest(root->right, k);
return ans;
}
private:
int ans = 0, cur = 0;
};
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int kthSmallest(TreeNode* root, int k) {
stack<TreeNode*> st;
while(root || !st.empty())
{
while(root)
{
st.push(root);
root = root->left;
}
root = st.top();
st.pop();
if(--k ==0) return root->val;
root = root->right;
}
return 0;
}
};