Red-Black tree generated by memball and treedraw



Red-Black Tree

This is a (much reduced in scale) red-black tree of processes running on my main desktop, ordered by allocated memory (produced by my memball and treedraw programs – so the tree is structured using the Reingold-Tilford algorithm).

If you count you will see that the path from the root (the little black ball at the top) to the leaves  – even smaller black dots at the bottom – always passes through five intervening black balls.

The graphic is a PNG produced from the very large (in scale) SVG. This is the far (highest memory use) end:

Biggest memory usersAnd here are the smallest memory users:

Smallest memory users