# y-Fast Trie #algorithm A y-Fast trie splits nodes into blocks. Each block is a balanced search tree and has 2/w to 2w nodes. The block maximums constitutes an [[x-Fast Trie]]. * [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/)