Hacker News new | ask | show | jobs
by CrimsonCape 467 days ago
This might be a little over my head, but i'm not understanding how the balanced parenthesis is conveying anything other than the topology of the tree structure. Are we not accounting for the bits required for a pointer in memory to an object? Or simply the bits required to guarantee the uniqueness of a node in the tree?
2 comments

You store the structural information separately from the data. The data can be stored sequentially in some traversal order.
He touches on indexes but doesn't really mention the implementation. This is about the primitives.