News for hackers. Stuff that matters.

A comment on B-Trees Require Fewer Comparisons Than Balanced Binary Search Trees. Parent comment

Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by DanielHB on Monday June 24, 2024 @03:50PM (#40779919)
Yeah, this is what I was thinking too. The rebalancing on AVL is a bit tricky but once you grok it, it is not that much code...
[ Parent | on HN ]

There are no comments on this comment yet.