# Sardine Tree #data-structure #b-tree Sardine tree is a B-tree which keys are small integers, and all the keys in a node can be packed into a single machine word. Integer algorithm exists to find the rank of a target integer in the packed node. * [Fusion Trees](https://www.dropbox.com/s/hwt7p8jh89q8ipm/CS166%20-%20Fusion%20Trees.pdf?dl=0) * [CS166: Data Structures](http://web.stanford.edu/class/cs166/)