Glossary: Data Structures and Algorithms in Go

Balanced tree

Also written: balanced, unbalanced, unbalanced tree

A tree whose subtrees are about the same height, so its height is about log₂ n and lookups are fast. A tree built from already-sorted inserts becomes an unbalanced chain with O(n) lookups.