COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Each node has exactly two children
|
|
|
Each node has exactly zero or two children
|
|
|
All the leaves are at the same level
|
|
|
Each node has exactly one or two children
|
Detailed explanation-1: -A full binary tree.is a binary tree in which each node has exactly zero or two children. A complete binary tree is a binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right.
Detailed explanation-2: -A Tree in which each node has exactly zero or two children is called full binary tree. A Tree in which the degree of each node is 2 except leaf nodes is called perfect binary tree.
Detailed explanation-3: -In other terms, a full binary tree is a binary tree in which all nodes, except the leaf nodes, have two offspring. A Full Binary Tree. Let, i be the number of internal nodes. n be the total number of nodes. l be number of leaves.
Detailed explanation-4: -Explanation: A full binary tree (sometimes proper binary tree or 2-tree or strictly binary tree) is a tree in which every node other than the leaves has two children.
Detailed explanation-5: -A general tree is a tree where each node may have zero or more children. The other types of trees are special cases of general trees. Mathematically it can be defined as a finite non-empty set of elements.