Beginner
Data Structures & Algorithms
Q39 / 100
What is the difference between a complete binary tree and a full binary tree?
Correct! Well done.
Incorrect.
The correct answer is B) Full: every node has 0 or 2 children; Complete: all levels filled except possibly the last (filled left to right)
B
Correct Answer
Full: every node has 0 or 2 children; Complete: all levels filled except possibly the last (filled left to right)
Explanation
Full binary tree: every node has 0 or 2 children. Complete binary tree: all levels are full except possibly the last, which is filled from left to right. Heaps use complete binary trees.
Progress
39/100