#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

A connected graph T without any cycles is called ________________.

Answer

free graph