Red-Black Tree Defense

Your server's index is a binary search tree. Data packets are flooding in. Each one slides down the tree (smaller ← → larger) and docks as a red leaf.

Click a node, then Left Rotate, Right Rotate or Recolor it.
The moment the whole tree is a valid red-black tree, GC wipes out every docked packet.
Let it lean: latency spikes eat your memory. Too deep: Stack Overflow.

Selected node

Click a node in the tree (or press ↑) to select it.

RB invariants

✓Root is black
✓No red node has a red child
✓Equal black-height on every path
✓H ≤ 2·log₂(N+1)

Patches loaded

none yet — clear a wave

syslogtail -f

Insert fix-up cheat sheet

Uncle red: recolor parent + uncle → black, grandparent → red. Repeat higher up.
Uncle black, zig-zag (node is inner child): rotate the parent outward so it becomes a straight line.
Uncle black, straight line: parent → black, grandparent → red, rotate the grandparent the opposite way.
Finally make the root black.

Rule 2	The root is black.
Rule 3	Empty (NIL) leaves count as black — always true here.
Rule 4	A red node never has a red child (orange pulsing edge).
Rule 5	Every path from a node down to a NIL leaf passes the same number of black nodes (yellow bh badge marks mismatches).

Latency spike	Tree depth H > 2·log₂(N+1): memory drains every second, faster the deeper you go.
Stack Overflow	H exceeds the call-stack limit (12 levels): instant crash.
Out of Memory	Memory hits 0 MB.

Click / tap	Select a node (floating menu appears)
Q · W · E	Left Rotate · Recolor · Right Rotate
Arrows	↑ parent, ← left child, → right child
F	Rubber duck: auto-apply one insert fix-up step (limited charges per wave)
X	REINDEX: rebuild a perfect tree instantly for 20 MB (packets collected without points)
P / Esc	Pause

Red-Black Tree Defense

Red-Black Tree Defense

> WAVE CLEARED

⏸ SIGSTOP

STACK OVERFLOW