Maximum sum path

#1

in time complexity sir said that in skewed tree the time complexity will be O(N) but i think for all types of trees it willl be O(N)

#2

@deepakjumani09 Yes you are right it will be O(N) in all the trees(including skewed trees)

#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.