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 abhgh on Sunday June 23, 2024 @11:10PM (#40772407)
Red-black trees use to make me anxious. I think the first time I grasped them was after watching Erik Demaine's lecture on the topic. For anyone interested it is this [1]; its still a very good reference on the topic!

[1] https://videolectures.net/mit6046jf05_demaine_lec10/

[ Parent | on HN ]
Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by cassepipe on Monday June 24, 2024 @06:31AM (#40774317)
RB trees still make me anxious which is why I use AA trees instead

https://en.wikipedia.org/wiki/AA_tree

[ Parent | on HN ]