Consider the following two statements. A binary tree T is full if each node is…
2020
Consider the following two statements.
A binary tree T is full if each node is either a leaf or possesses exactly two child nodes.
A binary tree T with n levels is complete if all levels except possibly the last are completely full, and the last level has all its nodes to the left side.
Which statements is/are TRUE
- A.
Only 2
- B.
Only 1
- C.
1 and 2
- D.
Neither 1 nor 2
Attempted by 441 students.
Show answer & explanation
Correct answer: C
Both statements are correct. A Full Binary Tree strictly restricts internal nodes to exactly two children (0 or 2 children total per node). A Complete Binary Tree ensures all levels are packed full sequentially from top-to-bottom, and the final level fills strictly from left-to-right without gaps.