← Binary Search TreesDSA 3.2.C

Kth-Smallest via In-Order

In-order traversal yields sorted output for free — the kth value falls out of the kth visit.

StatusPending

Notes from readers

Comments — via GitHub