Categorygithub.com/aandrade1234/go-algorithm-arenakth_smallest_element
package
0.0.0-20241024115004-42b9ea3511bc
Repository: https://github.com/aandrade1234/go-algorithm-arena.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

230. Kth Smallest Element in a BST

Given the root of a binary search tree, and an integer k, return the kth 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.
  • 1 <= k <= n <= 10^4
  • 0 <= Node.val <= 10^4

Source: Leetcode