Kth Smallest Element in a BST at Uber

Medium76.5% acceptance

This problem has 87.5% frequency at Uber.

Problem Description

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_.

Read full problem and hints

Topics

Tree Depth-First Search Binary Search Tree Binary Tree

Also asked at 10 companies

Amazon Bloomberg Cisco Expedia Google LinkedIn Meta Microsoft Oracle TikTok

View Full Problem

Problem Description

Topics

Also asked at 10 companies

More Uber Questions