Time and space complexity of this program

undirected graph is a tree or not time and space complexity

hello @kishoretaru
it is same as BFS .
i,e O(E+V)

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.