struct btrie_node* tree = root->btrie_root;
// Time complexity: O(log_2(log_2(N))) where N is the index to lookup
- while (lz && tree) {
+ while (bitmask && tree) {
i = (index & bitmask) >> lz;
struct btrie_node *subtree = 0, *pos, *n;
{
btrie->btrie_root = vzalloc(sizeof(struct btrie_node));
llist_init_head(&btrie->btrie_root->nodes);
+ llist_init_head(&btrie->btrie_root->children);
btrie->truncated = trunc_bits;
}