The data structure x-Fast Trie is a binary trie that

- The nodes of each layer are stored in Cuckoo hash table.
- Missing 0 and 1 child pointers are used to store links to siblings.

References

The data structure x-Fast Trie is a binary trie that

- The nodes of each layer are stored in Cuckoo hash table.
- Missing 0 and 1 child pointers are used to store links to siblings.

References