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:
- Red-black trees (cartesianproduct.wordpress.com)
- Red black tree resources and sources (cartesianproduct.wordpress.com)
- Interesting but lesser known data structures (stackoverflow.com)
- An Advanced Course on Algorithms (designkop.wordpress.com)
- GDSL – The Generic Data Structures Library, a free data structures manipulation library for C programmers (home.gna.org)
- Skip Lists are Fascinating (igoro.com)