A ______ of height h is full down to level h - 1,with level h filled in from left to right.
A)full binary tree
B)complete binary tree
C)balanced binary tree
D)general tree

Question

Quizplus · Accepted Answer

A complete binary tree is defined as a binary tree where all levels except possibly the lowest are completely filled, and the lowest level has all nodes as far left as possible. In this problem, the tree is full down to level h-1, meaning that all nodes on the levels above h-1 are filled. Additionally, level h is filled in from left to right, satisfying the requirement for a complete binary tree.

A ______ of Height H Is Full Down to Level