Height of a Binary Tree / Maximum depth of a binary tree Algorithm [REVISITED]

Find the height of a binary tree. The height of a binary tree is the maximum depth of the binary tree.The height of the root is called the height of the binary tree.

[codewithree]

Wow! Finaly I got someone who have deeply explained it..I got the feel...
Thanks a lot🙂

[vicky]

I've never seen someone has such great patience，really good explanation!

[KeithWarter]

Thank you for these videos! They are much appreciated!!!! This stuff needs to be slowed way down to grasp it at first just like a musical instrument. You taking the time to white board it like this is really really helpful.

[anupamdey]

Thank you for the in-depth explanation. No other video on YT explains the recursive calls which is the most imp part of trees.

[farahluvsd]

thank you, this is the best most detailed explanation i found, rather than just writing the code and explaining in 5 monutes

[vaishali]

Was about to have a breakdown because I was not getting this problem but your video made it very easy to understand. Thank you for the step by step explanation. धन्यवाद!

[amoghgowda]

I have seen many videos, Everyone says call the method recursively to find left height and right eight and find the max btw them. But no one told how the code is running line by line. But your the only person who showed how recursion works with 123 way of teaching, Loved the video.

[samyakjain]

Explaining recursion is very tough and you explained it in very easy manner

[mouseclicker]

Looked for explanations everywhere and you were the only one that explained it clearly enough for me to understand. Thank you!

[pauldaviddavies]

Wow, four years ago yet explaining the concept that deep as if it is being done today. Vivekanand that is great and deep. Thank you.

Where are my likes for him guys?

[xiaolongli]

There is an error:

for the last part:
if(left > right) {
int h = 1 + left;
}
else {
int h = 1 + right;
}
return h; <- you can't really return h here, because 'h' is defined inside of if-else loop.
You will need a global variable.
(unless I missed something in his video)

[VikiSangani]

Very easy and to the point explanation. Presentation is also very nice. Thank you for sharing knowledge. Looking forward the same in future.

[love_piano_]

I have literally searched every video related to this topic and this one cleared all my doubts, Thanking you so much Sir... 😃😃😃

[viveknandan]

Never thought someone can explain it so deeply... Thank you so much

[kartiksuman]

very well explained bhaiya....hmko ni lg atha ki mai isse samjh paunga, but you really made it possible...thanks a lot..

[danielchia]

This is helped me understand it after watching other videos that didnt explain it as detailed as you. Thank you !!

[vuramvincent]

Thank you so much !!! you have cleared all the confusion for the algorithm for searching the height of BST

[rishabhjaiswal]

Your are gem sir, I saw so many video but after watching your video I got the how its working, keep posting videos :)

[shreyassule]

Hi Sir, Thank you so much for these videos. Your style of explaining algorithms with examples and then walking us through each step of the code really helps to grasp the concept very effectively. If I may be allowed for just one small suggestion can you also please explain the time complexity for these? Regardless, great fan of your teaching. Keep up the good work!!

[ritik]

Excellent explanation for recursion . Really you have a very good understanding of dsa