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.
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
Show answerHide answer
Correct answer: (C) 1 and 2