[Verse 1]
Started with a binary tree, but rotation got me dizzy
Performance degraded when the data structure's busy
Enter Bayer's crimson theory, nodes painted red and black
Self-balancing algorithm keeps the search time on track
Every red node's children gotta be obsidian dark
Parent-child relationship with a colorful spark
Root stays black forever, that's the foundational law
Null leaves imagined black, that's what keeps the balance raw
[Chorus]
Red can't touch red, that's the cardinal rule
Black height equal paths, complexity's tool
Rotate left, rotate right, uncle's color decides
Red-black tree balancing, logarithmic rides
Paint it, flip it, reconstruct the spine
Properties preserved, performance divine
[Verse 2]
Insert a crimson vertex, might violate the code
Uncle's hue determines which correction mode
Red uncle means recolor, push the problem higher
Black uncle triggers rotation, structural rewire
Left-left case needs right rotation at the grandparent
Right-right case flips leftward, pattern's transparent
Left-right and right-left need double spins to fix
Zig-zag transformations, geometric tricks
[Chorus]
Red can't touch red, that's the cardinal rule
Black height equal paths, complexity's tool
Rotate left, rotate right, uncle's color decides
Red-black tree balancing, logarithmic rides
Paint it, flip it, reconstruct the spine
Properties preserved, performance divine
[Bridge]
Deletion's trickier, might disturb black height
Successor replacement, then analyze the sight
Double-black phantom when we lose obsidian shade
Sibling configurations guide the moves we've made
Cases one through four, each with different flow
Red sibling, black sibling, nephews high and low
[Verse 3]
AVL trees got strict height difference of one
Red-black more relaxed, but still gets it done
Roughly balanced structure, insertion stays efficient
Search and traversal smooth, algorithm sufficient
Database indexing, where this magic lives
File system organization, performance it gives
Two-three-four tree cousin, isomorphic design
Different representation, same complexity line
[Outro]
From insertion to deletion, colors guide the way
Self-adjusting elegantly, keeping chaos at bay
Red-black mastery achieved, data structure complete
Logarithmic guarantee, making algorithms sweet