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

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

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

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

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

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

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

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

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

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.

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

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. धन्यवाद!

You are excellent at explaining things clearly! Thank you for this video.

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.

appreciate you make a revisited video to cover previous doubt on height definition. good job.

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

THANKS SOO MUCH!!! I had a great deal of difficulty to understand the recursion portion of this solution! You explained it very easily! Thanks again man!

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?

Thank you Vivekanand for the clear explanation.

You are doing a great work sir , Your tutorials are really very helpful 🙏🙏

Thanks sir.... your clear explanations and presentation help better to understood..

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

The best explanation I've seen online. Thanks very much!

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

Thank you so much for the great explanation! Big appreciation from Japan

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

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

There is an error: for the last part: if(left > right) { int h = 1 + left; } else { int h = 1 + right; } return h;

Can you please create playlists under your channel ? Like trees, dynamic programming, graph

The best explanation！Keep posting！

Very slowly explained in the start. But you made it clear! Thanks :)

thankyou so much sir for such a detailed explanation

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

Good content! Detailed and precise explanation!

Thank you sir for great explanation !

Very well explained sir.. Thank you so much

Thank you for the in-depth explanation

This is the best explanation i found. Thanks. Need to watch at 2x

Very good explaination of recursion ...Thanku sir

Your videos have been very helpful

Thanks Vivekanand for your videos, your algorithms helps me a lot in learning Java.

If you compile this code, you will get an error on the line return h; That's because the two declarations of variable h are inside the scope of if { } and else { }. You're trying to use h outside it's scope.

Finally someone explained it....thank you so much

Thank you, I understand after seeing step by step

Very good explanation.

Amazing explanation!

Great explanation on this and the video about the diameter of a tree. Was able to solve the leetcode question on the first go. Sub'ed :)

Really good explanation, keep up the good work

Thanks a lot sir, you have removed all my confusion created by my prof.

Thanks a ton. Clear explanation.

really good videos, looking forward to more content

By this i learned recursion too thanks:)

Sir,You are the best!!

Your are Awesome !!!!!!!!!!!!!!!!!!!!! You made it very simple and clear.

VERY GOOD EXPLAINATION

thank you so much, for these videos. Awesome work

great explanation thank u sir

Good, I understand this very easily thank you!

Thnks sir by explaing thic concept of maxdepth and also recursion function

The best explanation ever

Great explanation👍👍

Best explanation ever!!!!

great job vivekanand....

very nice explanation sir

very nice explaination sir

thank you for the excellent videos!

Well said. Good explanation. Greetings from new york...... Cubao

great explanation....Thanks

Tremendous explainatio sir, ❤from BD

THANK YOU VERY MUCH SIR. Your ability to express is very good.

Thanks, buddy! It really Helped

Thank you so much brother you are doing great job

Very well Explained

thank you sir. worth to watch your videos..!!

In a nut-shell ,we are traversing the a binary tree to count the level at each node. Can you brief we, which kind of binary traversal we implemented in this video ? Can we implement same logic with different kind of traversal like inoder/preorder ?

sir please make the video on clone a binary tree with random pointers and also bactracking concept. your videos are very helpful for us🙂

I really liked the way you show small details like, why we add 1 in finding the height of a binary tree, most of of the videos simply add 1 and not explain any reason behind it, i know it is easy part but at least you explained.

Got in one go thank you Vivekanand !

Thank you, sir! you really helped me

I like your explanation algorithm

Thanks a lot for uploading it

Wow sir 🥰🥰....I could not hold myself to appreciate your explanation... Thank you sir...

Best Explanation Ever

Really nice explanation. ...thank you ...keep making videos

Easy to understand 😀😊

Good job man! Thank you

You explain better than anyone else. Most videos explain logic but don't have code. You do show code. But I just haven't seen any single video that explains with test cases (with input data) and code. After viewing your video I am still now sure what value of node is passed to the function. Is it pointers to left and right edge or is it something else?

finally mil hi gya.... thanks a lot

Thankyou so much , finally understood :)

Thank you so much!

Thanku so much sir ji

best explanation on the internet

Thanks, great explanation. Just one small suggestion with the code -- the variable h is declared locally within the "if" and "else" blocks, so is no longer in scope for the "return" statement. So you would need to declare h before the "if" statement.

it is really helpful

finally found what i needed ... thank you sir

Best explanation!!! :-)

THANK YOU SO MUCH SIR, THANKS A TON!!!

Thank you sooooo much sir

Good job sr

Good job 👍

In step 3 you can directly write. h = max(left , right) + 1; return h;