【LeetCode】Kth Smallest Element in a BST

最新推荐文章于 2022-08-12 12:05:29 发布

软货

最新推荐文章于 2022-08-12 12:05:29 发布

阅读量594

点赞数

分类专栏： JAVA 数据结构与算法 LeetCode 文章标签： BST 二叉树中序遍历第i最小元素 leetcode

本文链接：https://blog.csdn.net/baidu_22502417/article/details/46776807

版权

数据结构与算法同时被 3 个专栏收录

31 篇文章 0 订阅

订阅专栏

JAVA

25 篇文章 0 订阅

订阅专栏

LeetCode

12 篇文章 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.

算法思想

BST中序遍历为排序序列，直接技术前k个访问的数即可得到第k个最小的元素

算法实现

public class Solution {
    private int num = 0;
    private int c = 0;
    public void helper(TreeNode root, int k) {
        if(root.left != null) {
            helper(root.left, k);
        }

        c++;
        if (k == c){
            num = root.val;
            return;
        }

        if (root.right != null) {
            helper(root.right, k);
        }
    }
    public int kthSmallest(TreeNode root, int k) {
         helper(root,k);
         return num;
    }
}

算法时间

T(n) = O(lgn)

演示结果

这里写图片描述

public static void main(String[] args) {
        TreeNode root = new TreeNode(8);
        TreeNode l1 = new TreeNode(1);
        TreeNode l2 = new TreeNode(3);
        TreeNode l3 = new TreeNode(6);
        TreeNode l4 = new TreeNode(4);
        TreeNode l5 = new TreeNode(7);
        TreeNode l6 = new TreeNode(10);
        TreeNode l7 = new TreeNode(14);
        TreeNode l8 = new TreeNode(13);
        root.left = l2;
        root.right = l6;
        l2.left = l1;
        l2.right = l3;
        l3.left = l4;
        l3.right = l5;
        l6.right = l7;
        l7.left = l8;
        Solution s = new Solution();
        s.kthSmallest(root,3);
        System.out.println(s.num);
    }