COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
A node is a ____ if it has successor nodes-that is, if it has an out-degree greater than zero.
|
|
child
|
|
|
parent
|
|
|
siblings
|
|
|
none of above
|
Explanation:
Detailed explanation-1: -Any node which has one or more children is a parent node. A group of nodes with the same parent is called siblings.
Detailed explanation-2: -The ancestors of a node are all the nodes along the path from the root to that node.
Detailed explanation-3: -If the outdegree of every node is less than or equal to 2, in a directed tree than the tree is called a binary tree.
Detailed explanation-4: -1) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes.
There is 1 question to complete.