In the domain of Data Algorithms, a spanning tree T is basically a subgraph of an undirected graph G that is a tree that includes all of the vertices of G(the undirected graph), with the minimum possible number of edges.

BY Best Interview Question ON 12 Sep 2020