Re:Crit-bit Trees: the best way to store sets
by viraptor on Tuesday September 20, 2011 @06:43AM
(#3017043)
That's assuming you take "nonempty prefix-free set", "internal node", "bit string x such that x0 and x1" (not sure if they're supposed to be subscripts or are 0 and 1 bits) for granted. A picture solves the problem in many ways giving you real examples.
It's 45 words with lots of assumed knowledge that you could write books about ;)
It's 45 words with lots of assumed knowledge that you could write books about ;)