Q.

A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

A. Threaded tree
B. Complete binary tree
C. M-way search tree
D. Full binary tree
Answer» B. Complete binary tree
4.9k
0
Do you find this helpful?
27

View all MCQs in

Data Structures (DS)

Discussion

No comments yet