Multiple choice

Which of the following data structures can be defined as an undirected tree of a connected graph G which is composed of all the vertices and the edges necessary to connect all the nodes of graph G?

  1. Spanning forest

  2. Stacks

  3. Queues

  4. Spanning tree

  5. Null graph
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

A spanning tree can be defined as an undirected tree of a connected graph G which is composed of all the vertices and the edges necessary to connect all the nodes of graph G.

Keep practicing — related questions