The smallest number of levels that a binary tree with three nodes can have is two.

Name: The smallest number of levels that a binary tree with three nodes can have is two.
Brand: Quizplus
Rating: 4.9 (40 reviews)

Question

Quizplus · Accepted Answer

A binary tree with three nodes would consist of a root node with two child nodes. Therefore, the root node would be on the first level and the child nodes would be on the second level, making the minimum number of levels two.

The Smallest Number of Levels That a Binary Tree with Three