LeetCode - 230 - Kth Smallest Element in a BST

最新推荐文章于 2024-06-07 05:21:43 发布

_xiaoyuer

最新推荐文章于 2024-06-07 05:21:43 发布

阅读量178

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/j6635788/article/details/76152641

版权

LeetCode 同时被 2 个专栏收录

152 篇文章 0 订阅

订阅专栏

Tree

30 篇文章 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?

找出二叉搜索树中第k个最小的元素，中根遍历即可。

/**
 * 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 && k == 0) return 0;
        stack<TreeNode*> ans;
        while (root) {
            ans.push(root);
            root = root->left;
        }
        while (k > 0) {
            TreeNode* cur = ans.top();
            ans.pop();
            --k;
            if (k == 0) return cur->val;
            if (cur->right) {
                TreeNode* now = cur->right;
                while (now) {
                    ans.push(now);
                    now = now->left;
                }
            }
        }
        return -1;
    }
};