Multiple choice technology

Spanning tree is a ………..

  1. a type of tree

  2. A type of Graph

  3. Both 1& 2

  4. None of the above
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

A spanning tree is a type of graph. Specifically, it is a subgraph that is a tree and connects all the vertices together. A spanning tree of a connected, undirected graph is a subgraph that is a tree and includes all vertices of the original graph with minimum possible number of edges. So it is both a tree (by definition) and a type of graph (since trees are acyclic connected graphs).

Keep practicing — related questions