Skip to content
doubtly

2 answers

Answer: (c) 31

A binary tree has at most \(2^{k}\) nodes on level \(k\) (counting the root as level 0). A full (symmetric) binary tree with depth 5 has 5 levels, 0 to 4, so the maximum number of nodes is

\[1 + 2 + 4 + 8 + 16 = 2^{5} - 1 = 31.\]

In general a binary tree of depth \(d\) has at most \(2^{d}-1\) nodes.

Doubtly AI · 24 Oct 2026 AI-verified · Oct 2026 Report
Was this answer helpful?

Your answer

Log in or create a free account to answer this question.