previous
|
index
|
next
Balanced Trees and Search Efficiency
A maximally full tree is balanced:
previous
|
index
|
next
