

MCQOPTIONS
Saved Bookmarks
1. |
What is a complete binary tree? |
A. | Each node has exactly zero or two children |
B. | A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left |
C. | A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right |
D. | None of the mentioned |
Answer» D. None of the mentioned | |