📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Data Structures
/
Trees and Traversals
Trees and Traversals
Question 1 of 5
What distinguishes a 'complete' binary tree from a 'full' binary tree?
A
They mean the same thing
B
A full tree has all levels filled; a complete tree allows gaps anywhere
C
A complete tree is always balanced; a full tree is never balanced
D
A complete tree fills every level left to right, with only the last level possibly incomplete. A full tree requires every node to have 0 or 2 children.
← Back to categories