In a ______ of height h,all nodes that are at a level less than h have two children each.
A)general tree
B)binary tree
C)full binary tree
D)complete binary tree

Question

Quizplus · Accepted Answer

A full binary tree is a type of binary tree in which all nodes have either 0 or 2 children. Additionally, in a full binary tree of height h, all nodes at levels less than h are complete, meaning that they have 2 children each. Therefore, a full binary tree fits the given description. A general tree and a complete binary tree may have nodes with different numbers of children and do not necessarily follow the given description.

In a ______ of Height H,all Nodes That Are at a Level