Heap-Tree
October 3, 2023Data-Structures
October 3, 2023Data-Structures
|
Question 259
|
If node A has three siblings and B is a parent of A, what is the degree of A?
|
0
|
|
|
3
|
|
|
4
|
|
|
None of the above
|
Question 259 Explanation:
The degree of a vertex of a graph is the number of edges incident to the vertex, and in a multigraph, loops are counted twice.
According to question, there is no information regarding children nodes of node “A”. So the degree of A is 0.
According to question, there is no information regarding children nodes of node “A”. So the degree of A is 0.
Correct Answer: D
Question 259 Explanation:
The degree of a vertex of a graph is the number of edges incident to the vertex, and in a multigraph, loops are counted twice.
According to question, there is no information regarding children nodes of node “A”. So the degree of A is 0.
According to question, there is no information regarding children nodes of node “A”. So the degree of A is 0.