# Fusion Tree #data-structure Fusion is a B-tree that there are at most $w^{1/6}$ keys in a node. These keys can be compressed into a single machine word using approximate Patricia code. * [Fusion Trees](https://www.dropbox.com/s/hwt7p8jh89q8ipm/CS166%20-%20Fusion%20Trees.pdf?dl=0) * [CS166: Data Structures](http://web.stanford.edu/class/cs166/)