balanced tree

A tree kept close to its minimum possible height, O(log n), so that searches never take long paths.

In more detail

Self-balancing trees such as AVL trees, red-black trees and B-trees restore balance automatically after every insert or delete. Python's standard library has no balanced binary search tree; sorted lists with bisect or third-party packages fill the gap.

Related terms

Taught in

References