A connected graph T without any cycles is called _____________.

M

Mr. Dubey

🎓 Coach ⭐ 102.92K Points

📊 Data Structure (DS)

Q. A connected graph T without any cycles is called _____________.

(A) a tree graph.
(B) free tree.
(C) a tree.
(D) all of the above.

💬 Discuss

✅ Correct Answer: (D) all of the above.

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

153

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate