230. Kth Smallest Element in a BST(unsolved)

最新推荐文章于 2020-11-27 18:02:08 发布

gdmmzmj

最新推荐文章于 2020-11-27 18:02:08 发布

阅读量191

点赞数

分类专栏： leetcode算法心得

本文链接：https://blog.csdn.net/gdmmzmj/article/details/64218175

版权

leetcode算法心得专栏收录该内容

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

/**
 * 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 priorsearch(TreeNode* root, int& k){
        if(root)
        {
            int x=priorsearch(root->left,k);
            if(k==0) return x;
            else
            {
                k--;
                if(k==0)
                {
                    return root->val;
                }
                else
                    return priorsearch(root->right,k);
            }
        }
        return 0;
    }
    int kthSmallest(TreeNode* root, int k) {
        return priorsearch(root,k);
    }

};