Category:T-tree

A T-tree is a tree data structure based on AVL trees and B-trees that is useful for indexing in-memory databases. Rotations are performed just as in an AVL tree, but each node holds multiple items, allowing the cost of rotations to be amortized over more operations.