# x-Fast Trie #algorithm 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 * [x-Fast and y-Fast Tries](https://www.dropbox.com/s/0iujgypn9za2pog/CS166%20-%20x-Fast%20and%20y-Fast%20Tries.pdf?dl=0) * [CS166: Data Structures](http://web.stanford.edu/class/cs166/)