BST Search

AlgorithmbeginnerBST Operations

Compare with the node, go left if smaller, right if larger.

Decision · step 2 of 6Binary Search Tree: Search for 45

45 is smaller than 50: go left.

Open in the player →or start at step 2

What you will see

COMPARE -> MOVE along one edge -> FOUND or fall off the tree.

How binary search tree works →

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

Binary Search Tree

BST Insert Binary Search

Leads to

Topics that need this one first.

BST Insert BST Range Search Lowest Common Ancestor

Taught by the same lesson

Binary Search Tree covers these too, in the same run.

Binary Search Tree BST Delete BST Insert