Binary Tree Diameter

#1

plz explain the optimized code vs the first given coe,how time comp differ from nsquare to n

#2

hey @akb.tech17, in second approach we have n nodes and we are processing each of n nodes thatswhy it is O(n),

#3

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.