Doubt doubt doubt

#1

Bhaiya…can you explain what will be the complexity of code when we are calculating the diameter of binary tree without optimized approach.

Also, what will be the complexity of “height” function that we are using here…O(m*n) or O(N) …???

#2

Complexity of finding height is O(N)
Complexity of finding diameter is O(N^N)

#3

can you explain why complexity is O(N^N)…for this code??

#4

bcoz for each node u calculate height… so N*N

#5

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.