The number of nodes in a complete binary tree of depth d

number of nodes at level 0 1

number of nodes at level 1 2

...

number of nodes at level i 2i

number of nodes in total: 1+2+ ... + 2d = 2d+1-1

Previous slide

Next slide

Back to first slide

View graphic version