Data Structures Question:

What is a spanning Tree in data structure?

Answer:

A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

Download Data Structures PDF Read All 48 Data Structures Questions

Previous Question	Next Question
In RDBMS, what is the efficient data structure used in the internal storage representation?	Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?