In-Order Traversal
Domain: Data Structures
🎯 Motivation
Visit left subtree, then root, then right subtree. On a BST, this produces values in sorted ascending order.
📋 Concrete Example
For BST with root 50, left 25, right 75: in-order gives 25, 50, 75 — sorted! This is a free sorting trick.
🔗 Analogy
Reading a book: you read the left page, then the spine (centre), then the right page. For a BST this natural left-to-right reading gives sorted order.