Trees easy time O(n) space O(h)
In-order Traversal
In-order traversal visits the whole left subtree, then the node, then the right subtree. Because a BST stores smaller keys on the left, this order is exactly sorted order.
In-order: explore the left subtree, visit the node, then the right subtree.
1 / 16
Practice
Machine twin: /dsa-viz-v2/bst-inorder.json — the full deterministic run as structured data.