in this complexity of O(N) n is height or no of nodes
Bfs regarding doubt
Hello @deepakjumani09,
It is O(N) because you are traversing each node of the tree exactly once in this approach.
Hope, this would help.
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.