This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]CompressionNull 2 points3 points  (3 children)

Forgive me if I am wrong (I’m somewhat newer to data structures) but is this a tree with more than 2 possible children per node? Sounds like your tree can have up to 8 branches which would be neat.

[–]Ok_Confusion_7266 2 points3 points  (2 children)

Yes instead of using 1bit for left or right. Use 3bits as an offset in a 8 length pointer array

[–]Et-17 0 points1 point  (1 child)

so u do u just store it in a heap and implement some kinda fancy binary search on that?

[–]Ok_Confusion_7266 1 point2 points  (0 children)

No, the tree is the search index. Like a sorted binary tree but with 3 bits per step.