Beginner
Data Structures & Algorithms
Q26 / 100
What is a spanning tree of a graph?
Correct! Well done.
Incorrect.
The correct answer is B) A subgraph that is a tree and includes all vertices
B
Correct Answer
A subgraph that is a tree and includes all vertices
Explanation
A spanning tree of a connected graph contains all V vertices and exactly V-1 edges, forming a tree (no cycles). A minimum spanning tree minimizes total edge weight.
Progress
26/100