Kth Smallest Element in a BST

In-order traversal (left → node → right) on BST produces sorted order.

Count nodes visited. When count == k, you have your answer.

Stop early once found — do not traverse the whole tree.