# Kth Smallest Element In A BST: Practice Notes
Kth Smallest Element In A BST shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Inorder traversal yields sorted values; stop after k visits (iterative stack) and return that node.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(h+k).
## Common mistake
Collecting the whole inorder list and indexing [k-1], which wastes time on large trees.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI help for online coding assessments.