previous
|
index
|
next
Properties of Binary Trees
Suppose a binary tree has height
h
.
Let
leaves(h)
=
the maximum number of leaves
a tree of height
h
can have
Let
nodes(h)
=
the maximum number of nodes
a tree of height
h
can have
previous
|
index
|
next