Package g0201_0300.s0230_kth_smallest_element_in_a_bst

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    230 - Kth Smallest Element in a BST\.

    Medium

    Given the root of a binary search tree, and an integer k, return the <code>k<sup>th</sup></code> smallest value ( 1-indexed ) of all the values of the nodes in the tree.

    Example 1:

    Input: root = 3,1,4,null,2, k = 1

    Output: 1

    Example 2:

    Input: root = 5,3,6,2,4,null,null,1, k = 3

    Output: 3

    Constraints:

    • The number of nodes in the tree is n.

    • <code>1 <= k <= n <= 10<sup>4</sup></code>

    • <code>0 <= Node.val <= 10<sup>4</sup></code>

    Follow up: If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer kthSmallest(TreeNode root, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait