Post #2625675

I went least significant bit first and optimized for reducing the node count. This leads to a tree walk that gives the leaf nodes in a scrambled order. If you want them in-order I think that would work if you want most significant bit first. If you go MSB first and do not optimize for node count it seems to be called a ‘bit-trie’, among other names. The name ‘integer-keyed trie’ shows up, but I would consider that ambiguous. After all, what I just implemented is one, as well.