| Tree Efficiency |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | We
already know that the maximum height of a |
|||||||||||||
| binary
tree with N nodes is a height of N. |
||||||||||||||
| – | And,
an N-node tree with a height of N is LLL |
|||||||||||||
| • | It
is interesting to consider how many nodes a tree |
|||||||||||||
| might
have given a certain height. |
||||||||||||||
| – | If
the height is 3, then there can be anywhere between 3 |
|||||||||||||
| and 7
nodes in the tree. |
||||||||||||||
| – | Trees
with more than 7 nodes will require that the height |
|||||||||||||
| be
greater than 3. A full binary tree of height h -- should |
||||||||||||||
| have
2h-1 nodes in that tree |
||||||||||||||