Fill in the blank so the resulting statement is true.
A tree that is created from another connected graph and that contains all of the connected graph’s vertices, is connected, and contains no circuits is called a/an……………………….tree.
Solution:-
Spanning .