Spanning trees have a special class of depth-first search trees named _________
(a) Euclidean minimum spanning trees
(b) Tremaux trees
(c) Complete bipartite graphs
(d) Decision trees
This question was addressed to me in homework.
Question is taken from Spanning Trees topic in division Trees of Discrete Mathematics