Fantastic explanation, this deserves way more likes, thanks man! Your help while studying for interviews is invaluable, I hope great things happen for you and your family, keep up the good work!! 😀
That's correct. If you check the link in description to my github profile, you can find the optimized solution. The video also covers the optimized approach.
![Height of a Binary Tree / Maximum depth of a binary tree Algorithm [REVISITED]](/img/n.gif)
Yes true, very underrated channel! Come on TH-cam!
Really a underrated channel. Great explanation.Thank you sir
Fantastic explanation, this deserves way more likes, thanks man! Your help while studying for interviews is invaluable, I hope great things happen for you and your family, keep up the good work!! 😀
that is so heartwarming :)
Good explanation sir jii
you are welcome!!
What is an ootimized soln
An optimized solution is one which will consume the minimum memory and time possible to determine the answer
@@nikoo28 bro during online coding interview s we have to write only optimization solution
That's correct. If you check the link in description to my github profile, you can find the optimized solution. The video also covers the optimized approach.
Bro by using max(lh,rh) recursive approch and adding 1 we can get max deapth no
Yes, but even then you take up the memory space in your recursion stack.