COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
-1
|
|
|
Null
|
|
|
0
|
|
|
None of the above
|
Detailed explanation-1: -Nodes with no children are called leaves, or external nodes. Nodes which are not leaves are called internal nodes. Nodes with the same parent are called siblings.
Detailed explanation-2: -The height of a tree is a height of a root. A general tree is a tree where each node may have zero or more children (a binary tree is a specialized case of a general tree). General trees are used to model applications such as file systems.
Detailed explanation-3: -A node is a leaf node if both left and right child nodes of it are NULL.
Detailed explanation-4: -A leaf node is a node that has no children. A node that does have children is known as an internal node. The root is an internal node, except in the special case of a tree that consists of just one node (and no edges).