Interactive DSA and system design

Learn complex engineering ideas by watching them move.

6stepsO(log n)averageO(h)space

Trees lab

BST Node Insertion Flow

Step 1 / 6

Comparing Node Active / Traversed Node Inserted Duplicate / Match

Animation speed

Space play / pause←→ stepR reset

Current operation

Start Insertion Process

We want to insert key 8 into the Binary Search Tree. We always begin our traversal from the Root node.

Algorithm state

8Key to Insert

Interactive Node Insertion

Insert a positive integer (1-99) to animate its placement in the tree.

Complexity notes

O(log n)averageO(n)worstO(h)spaceNostable

Synced code trace

function insert(node, key) {  if (node === null) return new Node(key);  if (key < node.value)    node.left = insert(node.left, key);  else if (key > node.value)    node.right = insert(node.right, key);  return node;}

Interactive Notes

✓ Notes are saved automatically and persist per step.