HackerRank - Height of a Binary Tree | Full solution with code and animations | Study Algorithms

[@bigjofa]

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!! 😀

[@nikoo28]

that is so heartwarming :)

[@Ayush-yk6zf]

Really a underrated channel. Great explanation.Thank you sir

[@bittujacob8776]

Yes true, very underrated channel! Come on KZbin!

[@Sana-oi6mw]

Good explanation sir jii

[@nikoo28]

you are welcome!!

[@mashapoguajay3322]

What is an ootimized soln

[@nikoo28]

An optimized solution is one which will consume the minimum memory and time possible to determine the answer

[@mashapoguajay3322]

@@nikoo28 bro during online coding interview s we have to write only optimization solution

[@nikoo28]

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.

[@mashapoguajay3322]

Bro by using max(lh,rh) recursive approch and adding 1 we can get max deapth no

[@nikoo28]

Yes, but even then you take up the memory space in your recursion stack.