Skip to content

Glossary: Data Structures and Algorithms in JavaScript

Self-balancing tree

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

A tree, such as an AVL tree or red-black tree, that rearranges nodes as you insert to keep its height near log₂ n, avoiding the long-chain worst case.

Where the book teaches it

Related terms

Balanced treeBinary search tree (BST)