More on Complete Binary Trees

Introduction

Previous lessons touched upon complete binary trees in the last lesson, but here are more detailed properties of them:

• All the levels are completely filled, except the last one possibly.
• Nodes at the last level are as far left as possible.
• The total number of nodes in a complete binary tree of height “h” are: $2^h \leq nodes \leq 2^{h+1}-1$. Again, this is based on the geometric series formula: $2^0+2^1+2^3+2^4+...+2^r = 2^{r+1}-1$.