[Leetcode 230, Medium] Kth Smallest Element in a BST

simplify2012

关注

原创最新推荐文章于 2026-09-02 19:50:02 发布 555 阅读 AI 写同款· GEO 优化 ›

从服装打版到激光切割：二维异形件排版算法在实际生产中的避坑指南本文深入探讨二维异形件排版算法在服装、家具等行业的实际应用，对比NFP和重叠移除两种核心策略的优缺点，并提供算法落地的五大实战陷阱与解决方案。通过案例分析和技术要点解析，帮助生产管理者提升材料利用率5%-15%，优化生产效率。阅读详情

Problem:

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.

Analysis:

Solutions:

C++:

    int kthSmallest(TreeNode* root, int k) {
        stack<TreeNode *> node_stack;
        node_stack.push(root);
        TreeNode *p_cur_node = root->left;
        while(p_cur_node || !node_stack.empty()) {
            if(p_cur_node) {
                node_stack.push(p_cur_node);
                p_cur_node = p_cur_node->left;
                continue;
            }
            
            if(!node_stack.empty()) {
                p_cur_node = node_stack.top();
                --k;
                if(k == 0)
                    return p_cur_node->val;
                node_stack.pop();
                p_cur_node = p_cur_node->right;
            }
        }
        
        return -1;
    }

Java:

Python:

收录于