Glossary: Data Structures and Algorithms in Go

Self-balancing tree

Also written: AVL tree, AVL trees, red-black tree, red-black trees

A search tree, such as an AVL or red-black tree, that rearranges its nodes as you insert to keep its height near log₂ n. Databases use relatives of these to index rows.