Complete vs full vs perfect binary trees in Data Structures Theory - Visual Side-by-Side Comparison

Concept Flow - Complete vs full vs perfect binary trees

Start with Binary Tree

↓

Are all levels except the last fully filled?

↓

Is last level filled left to right?

↓

Complete Tree

↓

All nodes have 0 or 2 children?

↓

Full Tree

This flow shows how to classify a binary tree by checking if all levels except the last are fully filled, if the last level is filled left to right, and if all nodes have 0 or 2 children.

Execution Sample

Data Structures Theory

Tree:
      1
     / \
    2   3
   / 
  4  

This tree is complete but not full or perfect because last level is not fully filled and node 2 has only one child.

Analysis Table

Step	Check	Condition	Result	Classification
1	Check if all levels except last are fully filled	Levels 0 and 1 fully filled	True	Continue
2	Check if last level is filled left to right	Node 4 is left child, no gaps	True	Continue
3	Check if all nodes have 0 or 2 children	Node 2 has only one child	False	Not Full
4	Check if all levels fully filled	Last level not fully filled	False	Not Perfect
5	Conclusion	-	-	Tree is Complete but not Full or Perfect

💡 Last level is filled left to right but not fully filled, and node 2 has only one child, so tree is Complete only.

State Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	Final
All levels except last fully filled	Unknown	True	True	True	True
Last level filled left to right	Unknown	Unknown	True	True	True
All nodes have 0 or 2 children	Unknown	Unknown	Unknown	False	False
Tree classification	Unknown	Unknown	Unknown	Not Full	Complete only

Key Insights - 3 Insights

Why is the tree not considered full even though most nodes have two children?

Because node 2 has only one child, violating the full tree rule that every node must have 0 or 2 children (see execution_table step 3).

Why is the tree classified as complete if the last level is not fully filled?

Because the last level is filled from left to right without gaps, which satisfies the complete tree condition (see execution_table step 2).

What makes a tree perfect compared to complete?

A perfect tree has all levels fully filled with no missing nodes, unlike a complete tree which allows the last level to be partially filled left to right (see execution_table steps 1 and 4).

Visual Quiz - 3 Questions

Look at the execution table, at which step do we find the tree is not full?

A Step 4

B Step 3

C Step 2

D Step 1

💡 Hint

Check the 'All nodes have 0 or 2 children' condition in execution_table step 3.

According to variable_tracker, what is the final classification of the tree?

A Complete only

B Full and Perfect

C Perfect only

D Not Complete

💡 Hint

Look at the 'Tree classification' row in variable_tracker final column.

If node 2 had two children, how would the classification change?

A Tree remains Complete only

B Tree becomes Perfect

C Tree becomes Full and Complete

D Tree becomes Not Complete

💡 Hint

Refer to key_moments about full tree condition and execution_table step 3.

Concept Snapshot

Complete Binary Tree:
- All levels fully filled except possibly last
- Last level filled left to right

Full Binary Tree:
- Every node has 0 or 2 children

Perfect Binary Tree:
- All levels fully filled
- Tree is both full and complete

Full Transcript

This visual execution trace compares complete, full, and perfect binary trees. It starts by checking if all levels except the last are fully filled, then if the last level is filled left to right, and finally if every node has either zero or two children. The example tree is complete because its last level is filled left to right without gaps, but not full because one node has only one child. It is also not perfect because the last level is not fully filled. Key moments clarify why the tree is not full and how perfect trees differ from complete ones. The quizzes test understanding of these conditions and classifications.

Practice

1. Which of the following best describes a full binary tree?

easy

A. All levels are completely filled, including the last level.

B. Every node has either 0 or 2 children, no nodes have only one child.

C. All leaves are at the same level and every internal node has two children.

D. Nodes at the last level are as far right as possible.

Solution

1. Step 1: Understand the definition of a full binary tree

   A full binary tree is defined as a tree where every node has either zero or two children, meaning no node has only one child.

2. Step 2: Compare with other tree types

   Complete binary trees focus on filling levels left to right, and perfect binary trees are both full and complete with all leaves at the same level.

3. Final Answer:

   Every node has either 0 or 2 children, no nodes have only one child. -> Option B

4. Quick Check:

   Full binary tree = nodes have 0 or 2 children [OK]

Hint: Full means nodes have 0 or 2 children only [OK]

Common Mistakes:

• Confusing full with complete trees
• Thinking full means all levels filled
• Assuming nodes can have one child

2. Which property must a perfect binary tree always satisfy?

easy

A. All levels except the last are completely filled, and last level nodes are left aligned.

B. Nodes at the last level can be anywhere, not necessarily left aligned.

C. Every node has at most one child.

D. Every node has either 0 or 2 children, and all leaves are at the same level.

Solution

1. Step 1: Recall the definition of a perfect binary tree

   A perfect binary tree is both full and complete, meaning every node has 0 or 2 children and all leaves are at the same level.

2. Step 2: Eliminate incorrect options

   All levels except the last are completely filled, and last level nodes are left aligned. describes a complete tree, not necessarily perfect. Nodes at the last level can be anywhere, not necessarily left aligned. contradicts the left alignment rule. Every node has at most one child. is incorrect as perfect trees have nodes with two children.

3. Final Answer:

   Every node has either 0 or 2 children, and all leaves are at the same level. -> Option D

4. Quick Check:

   Perfect tree = full + all leaves same level [OK]

Hint: Perfect = full + all leaves at same level [OK]

Common Mistakes:

• Mixing complete and perfect tree definitions
• Ignoring leaf level uniformity
• Assuming last level nodes can be scattered

3. Consider the following binary tree structure:

       A
      / \
     B   C
    / 
   D 

Which type of binary tree is this?

medium

A. Complete binary tree

B. Full binary tree

C. Perfect binary tree

D. None of the above

Solution

1. Step 1: Analyze the tree structure

   The tree has root A with two children B and C. Node B has one child D. Node C has no children.

2. Step 2: Check properties against tree types

   Node B has exactly one child, so it is not full (full requires every node has 0 or 2 children). Levels 0 and 1 are completely filled; level 2 has D as far left as possible: complete. Leaves C (level 1) and D (level 2) not same level: not perfect.

3. Final Answer:

   Complete binary tree -> Option A

4. Quick Check:

   Last level left aligned but not full = complete tree [OK]

Hint: Complete trees fill left to right, full requires 0 or 2 children [OK]

Common Mistakes:

• Assuming missing right child means not complete
• Confusing full with complete
• Thinking perfect applies without full and complete

4. Identify the error in the following statement:
A perfect binary tree can have nodes with only one child.

medium

A. Incorrect, perfect trees require all internal nodes to have two children.

B. Correct statement, perfect trees allow one child nodes.

C. Incorrect, perfect trees only require last level to be full.

D. Correct, as long as the tree is complete.

Solution

1. Step 1: Understand perfect binary tree requirements

   Perfect binary trees are both full and complete, meaning every internal node must have exactly two children.

2. Step 2: Evaluate the statement

   The statement claims nodes can have only one child, which contradicts the full tree property required for perfect trees.

3. Final Answer:

   Incorrect, perfect trees require all internal nodes to have two children. -> Option A

4. Quick Check:

   Perfect tree = no single-child nodes [OK]

Hint: Perfect trees never have single-child nodes [OK]

Common Mistakes:

• Confusing complete with perfect tree rules
• Thinking one child allowed if tree is complete
• Ignoring full tree property in perfect trees

5. You have a binary tree with 15 nodes. It is known to be a perfect binary tree. How many leaf nodes does it have?

hard

A. 7

B. 16

C. 8

D. 15

Solution

1. Step 1: Recall leaf count formula for perfect binary trees

   In a perfect binary tree, the number of leaf nodes is (n + 1) / 2, where n is the total number of nodes.

2. Step 2: Calculate leaf nodes for 15 nodes

   Using the formula: (15 + 1) / 2 = 16 / 2 = 8 leaf nodes.

3. Final Answer:

   8 -> Option C

4. Quick Check:

   Leaf nodes = (total nodes + 1) / 2 = 8 [OK]

Hint: Perfect tree leaves = (nodes + 1) / 2 [OK]

Common Mistakes:

• Using total nodes as leaf count
• Confusing full and perfect tree leaf counts
• Forgetting leaf count formula