Coding Interview PatternsKth Smallest Element in a BST
MediumTree Depth-First Search

Kth Smallest Element in a BST

Explanation & Solution

Practice Problem

Description

Given the root of a binary search tree and an integer k, return the kth smallest value of all the values of the nodes in the tree.

Previous
Validate Binary Search Tree
Next
Path Sum