Glossary: Data Structures and Algorithms

Self-balancing tree (AVL, red-black)

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

A tree that rearranges its nodes as items are inserted so its height stays near log₂ n. AVL trees and red-black trees are examples, and databases use relatives of them to index rows.