4 ms·
It pretty much has no practical use, that a different data structure couldn't do more efficiently.
by stcredzero 10y ago
It pretty much has no practical use, that a different data structure couldn't do more efficiently.
- poikniok 10y agoWhat in the world are you talking about, RB trees are incredibly useful.
- stcredzero 10y agoThere's a well known analysis that shows they're asymptotically equivalent to B-trees. You can tune a B-tree to better exploit cache locality. Other kinds of ordered binary trees are far less complicated to code and have similar performance characteristics.