Complete Binary Trees
•
A complete binary tree is one which is a
full binary tree to a level of its height-1 ...
–
then at the last level, it is filled from left to
right. For example:
