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

I would expect B-trees to outperform binary trees even in a persistent data structure. The necessity of binary trees comes when you need stable iterators/references.


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

Search: