Find the Kth Smallest Value in a Binary Search Tree
Company: Amazon
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Build a binary search tree from a breadth-first serialization and return its kth smallest value. The prompt defines one-based rank, explicit nulls, implicitly null trailing slots, distinct keys, valid inputs, and a large-tree bound suitable for iterative in-order traversal.
