COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following statement about binary tree is CORRECT?
|
|
Every binary tree is either complete or full
|
|
|
Every complete binary tree is also a full binary tree
|
|
|
Every full binary tree is also a complete binary tree
|
|
|
A binary tree cannot be both complete and full
|
Explanation:
Detailed explanation-1: -No binary tree is both complete and full.
Detailed explanation-2: -Detailed Solution The correct answer is option 3. Concept: Option 1: A binary tree is called a strictly binary tree if every non-leaf node of it has a non-empty left and right subtree. True, A binary tree is said to be strictly binary if every non-leaf node in it has nonempty left and right subtrees.
Detailed explanation-3: -A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. Option 1: In a binary tree, each node must have at least one child node. A binary tree can take a linked list form and hence option 3 is incorrect.
There is 1 question to complete.