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

Zip trees are great!

For a project I made a version that uses the memory location of the entries to construct the (random) rank on the fly.

So it’s a binary tree structure that requires the same memory as a linked list (two pointers) only!

https://github.com/open62541/open62541/blob/master/deps/zipt...




I don't know anything about zip trees, but I'd think in a common scenario the memory addresses are reasonably consecutive. Would that be a problem? If not, why not just assign consecutive ranks in the first place?


The address is scrambled (similar to a random-number generator) to produce the rank. So consecutive locations do not hurt performance.




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

Search: