| Binary Search Trees |
|
|
|
|
|
|
|
|
|
|
|
| • | This
has a height of 4 and is a full binary tree at |
|||||||||
| level
3. |
||||||||||
| • | But,
at level 4, the leaves are filled in from left to |
|||||||||
| right! |
||||||||||
| • | From
this definition, we realize that a full binary |
|||||||||
| tree
is also considered to be a complete binary |
||||||||||
| tree. |
||||||||||
| • | However,
a complete binary tree does not |
|||||||||
| necessarily
mean it is full! |
||||||||||