Check connectivity with BFS/DFS, then check for cycles separately.
This requires two passes. Also, cycle detection in undirected graphs needs care to avoid false positives from back-edges to parent.
Can you check both conditions in one pass?
Pattern 22: LeetCode Interview Patterns24 sections · 736 units
Open in CourseLeetCode 261 Graph Valid Tree - Why Naive Fails
The trap