More on Complete Binary Trees

Introduction

We touched upon complete binary trees in the last lesson, but here are some of their more detailed properties.

• All the levels are completely filled except possibly the last one
• 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$. This is again based on the Geometric Series formula: $2^0+2^1+2^3+2^4+...+2^r = 2^{r+1}-1$.