News for hackers. Stuff that matters.
Re:Show HN: New Lisp data structure by daniel-cussen on Wednesday December 01, 2010 @06:28PM (#1960206)
Predictable structure and smaller nodes.

And most of the other advantages linked lists have over binary trees, with some of those advantages being slower.

Re:Show HN: New Lisp data structure by jemfinch on Wednesday December 01, 2010 @07:46PM (#1960465)
If I'm using both as a abstract data types, does predictable structure really help me at all?
Re:Show HN: New Lisp data structure by daniel-cussen on Wednesday December 01, 2010 @09:36PM (#1960768)
If you're using it for code (the way Lisp uses linked lists) you know when one function ends and a nested one begins.

I'd like to point out, however, that this is in theory, as I haven't seen this data structure doing anything other than moving data around.