Kth Smallest Element in a BST 寻找二叉排序树中第k小元素

最新推荐文章于 2024-07-09 13:30:51 发布

匿名侠士

最新推荐文章于 2024-07-09 13:30:51 发布

阅读量1.1k

点赞数

分类专栏： LeetCode OJ ACM 精选文章标签： leetcode oj

本文链接：https://blog.csdn.net/u012605629/article/details/48654175

版权

ACM 精选同时被 2 个专栏收录

295 篇文章 0 订阅

订阅专栏

LeetCode OJ

199 篇文章 0 订阅

订阅专栏

Kth Smallest Element in a BST

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) {}
 * };
 */
 /*
1、计算左子树元素个数left。
2、 left+1 = K，则根节点即为第K个元素
    left >=k, 则第K个元素在左子树中，
    left +1 <k, 则转换为在右子树中，寻找第K-left-1元素。
 */
class Solution {
public:
    int kthSmallest(TreeNode* root, int k) {
        if(root==NULL)
            return 0;
        int leftSize=calNode(root->left);
        if(leftSize+1 == k)
            return root->val;
        else if(leftSize+1 < k)
            return kthSmallest(root->right,k-leftSize-1);
        else
            return kthSmallest(root->left,k);
    }
    
    int calNode(TreeNode *head){
        if(head==NULL)
            return 0;
        return calNode(head->left)+calNode(head->right)+1;
    }
};