Q.

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. A tree In which all nodes have degree 2
Answer» C. A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right
4.4k
0
Do you find this helpful?
39

View all MCQs in

Data Structures (DS)

Discussion

No comments yet