I believe RB-trees are preferred e.g. in the linux kernel because of pointer sta... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

jstimpfle on Nov 10, 2018 | parent | context | favorite | on: Beating hash tables with trees? The ART-ful radix ...

I believe RB-trees are preferred e.g. in the linux kernel because of pointer stability.

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