[leetcode] 230. Kth Smallest Element in a BST

最新推荐文章于 2024-09-18 18:23:55 发布

denny851108

最新推荐文章于 2024-09-18 18:23:55 发布

阅读量245

点赞数

分类专栏： leetcode 文章标签： medium leetcode

本文链接：https://blog.csdn.net/denny851108/article/details/52178554

版权

leetcode 专栏收录该内容

179 篇文章 0 订阅

订阅专栏

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?

解法一：

inorder的遍历就可以获得bst中node从小到大的排序。所以很显然要用到inorder traversal。这里是用的iterative的方法，当遍历到k个数的时候返回该node的值。

/**
 * 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*> s; 
        TreeNode* p = root;
        int cnt = 0;
        
        while(p || !s.empty()){
            while(p){
                s.push(p);
                p = p->left;
            }
            p = s.top(); s.pop();
            if(++cnt==k) return p->val;
            p = p->right;
        }
        return 0;
        
    }
};

解法二：

这里是recursive的解法。

/**
 * 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) {
        return kthSmallestDFS(root,k);
    }
    
    int kthSmallestDFS(TreeNode* root, int &k){
        if (!root) return -1;
        int value = kthSmallestDFS(root->left, k); 
        if(!k) return value;
        if(!--k) return root->val;
        return kthSmallestDFS(root->right, k);
    }
};