previous
|
index
|
next
The Height of Balanced Binary Trees
Q:
What is the height of a balanced binary tree of size
n
?
n
=
2
h + 1
− 1
n + 1
=
2
h + 1
log
2
(n + 1)
=
log
2
(2
h + 1
)
log
2
(n + 1)
=
h + 1
previous
|
index
|
next