BST Insert

AlgorithmbeginnerBST Operations

Search for the value and hang a new leaf wherever the search runs out of tree.

Decision · step 2 of 6Binary Search Tree: Insert 65

65 is larger than 50: go right.

Open in the player →or start at step 2

What you will see

COMPARE -> MOVE -> the empty spot is highlighted -> the node grows in with its edge.

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

BST Search

BST Delete

Leads to

Topics that need this one first.

BST Delete AVL Insert with Rebalancing

Taught by the same lesson

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

Binary Search Tree BST Delete BST Search