Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I wouldn't say RB-tree rebalancing is much simpler. On the other hand, in B-trees there's a whole lot of poorly documented nuances, binary trees are more intuitive. But in the end of the day the implementation effort perfectly worth it. https://www.scylladb.com/2021/11/23/the-taming-of-the-b-tree...


Yeah, balanced trees of any kind are fairly complex compared to skip lists.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: