Consider the following two statements. 1. A binary tree T is ful
|
Consider the following two statements.
1. A binary tree T is full if each node is either a leaf or possesses exactly two child nodes.
2. 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 statement is/are TRUE
A. Only 1
B. Only 2
C. 1 and 2
D. Neither 1 nor 2
Please scroll down to see the correct answer and solution guide.
Right Answer is: C
SOLUTION
Explanation:
Statement 1: TRUE
It is definition of binary tree, which is full, this is also called as perfect binary tree.
Example of Binary tree which is FULL:
Statement 2: TRUE
It is definition of binary tree which is complete.
Example of Binary tree which is COMPLETE:
