A complete binary tree of n nodes has a height of log2(n + 1).

Question

Quizplus · Accepted Answer

A complete binary tree has all levels completely filled except for the last level which is filled from left to right. The number of nodes in a complete binary tree of height h can be expressed as 2^(h+1) - 1. Therefore, the number of nodes in a complete binary tree of height log2(n + 1) can be expressed as 2^(log2(n+1)+1) - 1 = 2(n+1) - 1. This means that a complete binary tree of n nodes has a height of log2(n+1).

A Complete Binary Tree of N Nodes Has a Height