Buddy Allocator: Memory Map & Split Tree

The buddy system is the power-of-two memory allocator behind the Linux kernel's page allocator and generations of Unix kmem subsystems before it. This 2D simulator renders a real memory pool two ways at once: a linear memory map showing exactly how the pool is currently partitioned, and the full binary buddy tree beneath it, so you can see precisely which region was split to satisfy a request and which two buddies recombined when you freed a block. Request a chunk of memory and watch the allocator repeatedly halve the smallest sufficient free block; free any allocated block and watch it recursively merge with its buddy — and its buddy's buddy — the instant both sides are free again. Resize the pool itself, toggle a fragmentation heatmap, and drag/zoom the tree to inspect deep splits up close.