A binary tree with depth d is complete if
A) each level L

Question

A binary tree with depth d is complete if
A) each level L < d has 2L nodes
B) every node that is not a leaf has 2 children
C) every node that is not a leaf has 2 children and and all nodes at level d are as far to the left as possible
D) each level L < d has 2L nodes and all nodes at level d are as far to the left as possible

Quizplus · Accepted Answer

A complete binary tree is defined such that all levels except possibly the last are fully filled, and all nodes in the last level are as far left as possible.

A Binary Tree with Depth D Is Complete If