Consider the following two statements. A binary tree T is full if each node is…
Coal India · Computer Science · 2019
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 1071 students.
Show answer
Correct answer: C
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…