What is the key difference between a complete binary tree and a full binary tree?
A. A complete binary tree is filled completely at all levels except possibly the last, while a full binary tree has all nodes with either 0 or 2 children.
B. A full binary tree is filled completely at all levels except possibly the last, while a complete binary tree has all nodes with either 0 or 2 children.
C. A complete binary tree has only one level, while a full binary tree has multiple levels.
D. There is no difference.
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion