Find Minimum and Maximum
The minimum is all the way left and the maximum all the way right. One path each.
Decision · step 2 of 5BST Queries: Find the minimum
50 has a left child, so something smallest is still below. Keep going.
What you will see
Focus slides down the left (or right) spine.
Cost
| Best | O(1) |
|---|---|
| Average | O(log n) |
| Worst | O(n) |
| Space | O(1) |
How you work with it here
play it through, step one change at a time, scrub to any step, run it on your own input, predict what happens next, try operations in any order.
Screen readers: Nodes announce value, left child and right child; each step announces the comparison and the direction taken or the structural change.
Reduced motion: Focus jumps node to node with a static ring; rotations become a crossfade between the two layouts.
Before this
Taught by the same lesson
BST Queries covers these too, in the same run.