230. Kth Smallest Element in a BST

shanshanhi

于 2017-01-14 12:15:46 发布

阅读量211

点赞数

分类专栏： leetcode-tree 文章标签： 230 Kth smallest BST leetcode

本文链接：https://blog.csdn.net/shanshanhi/article/details/54426081

版权

leetcode-tree 专栏收录该内容

29 篇文章 1 订阅

订阅专栏

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?
方法一、非递归的方法

int kthSmallest(TreeNode* root, int k) {
        int cnt = 0;
        stack<TreeNode*> s;
        TreeNode *p = root;
        while (p || !s.empty()) {
            while (p) {
                s.push(p);
                p = p->left;
            }
            p = s.top(); s.pop();
            //cout<<"cnt="<<cnt<<" "<<p->val<<endl;
            ++cnt;
            if (cnt == k) return p->val;
            p = p->right;
        }
        return 0;
    }

方法二、递归的方法

int kthSmallest(TreeNode* root, int k) {
        return kthSmallestDFS(root, k);
    }
    int kthSmallestDFS(TreeNode* root, int &k) {
        if (!root) return -1;
        int val = kthSmallestDFS(root->left, k);
        if (!k)  return val;
        if (!--k) return root->val;
        return kthSmallestDFS(root->right, k);
    }