3 ms·
Predictable structure and smaller nodes. And most of the other advantages linked lists have over binary trees, with some of those advantages being slower.
by daniel-cussen 16y ago
Predictable structure and smaller nodes.
And most of the other advantages linked lists have over binary trees, with some of those advantages being slower.
- jemfinch 16y agoIf I'm using both as a abstract data types, does predictable structure really help me at all?
- daniel-cussen 16y agoIf 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.