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.

[@codewithree930]

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

[@chaminduperera3998]

mmmmm....

[@Man_of_Culture.]

Yep, he gives us the feel of ds

[@anandoganiya9070]

not like apna college

[@Man_of_Culture.]

@@anandoganiya9070 both of them are good , I follow many KZbin channel on DS and Algo because in the end it's about learning and learning .

[@anandoganiya9070]

@@Man_of_Culture. ik but they are running which leads to misunderstanding and lots of confusion but this guy explains it just right best for beginners

[@vicky888]

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

[@anupamdey4893]

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

[@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.

[@amoghgowda6117]

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.

[@farahluvs1d]

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

[@samyakjain8384]

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

[@vaishali3339]

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

[@mouseclicker4955]

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?

[@love_piano_3000]

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

[@danielchia1389]

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

[@xiaolongli1898]

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

[@juanefrainpaquiyauri6590]

glad that somebody else noticed that

[@AbdullahKhan-pv1qz]

you are right, h cant be returned

[@rishabhjaiswal3276]

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

[@viveknandan4950]

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

[@shivamnerwal72]

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

[@vuramvincent721]

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

[@VikiSangani]

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

[@kartiksuman9814]

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

[@ryujiganaha9645]

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

[@jammy2003]

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!

[@arjunsankarlal5296]

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

[@piyusharmaus]

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.

[@harshitrathi3077]

1should not be added , he is wrong

[@vickyhu6970]

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

[@onyinyechichukwuma689]

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

[@ritik8879]

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

[@KamalKumar-bk6rn]

Thank you Vivekanand for the clear explanation.

[@rishipalbhatia]

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.

[@shreyassule2219]

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

[@raunak02]

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

[@modernsanskari4398]

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

[@yoonlee5278]

I think he meant to explain purely used conditional statement for the people to understand more easily.

[@reyou7]

You can take entire code, and put in a text box, and turn into a single line. shorter != better.

[@sunitamishra5475]

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

[@LarryRuane]

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.

[@usman3D]

Exactly my thoughts

[@souravghosh7093]

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

[@mfgucluer]

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

[@vivekanandkhyade]

You are most welcome

[@jamesqiu6715]

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

[@anjalidarokar2408]

Sir, the height of a binary tree is the number of edges in the longest path from the root to the leaf, not the number of nodes from the root to the leaf, therefore, here, height = 4.

[@Sun-yv9fr]

you are talking about the depth. Depth is 4 and height is 5.

[@adityasagarr]

@@Sun-yv9fr google it...

[@m.motivation6299]

The best explanation ever

[@gokarnapandey4930]

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

[@chetanjain5097]

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?

[@prathameshautade2679]

Really good explanation, keep up the good work

[@vishnu_bhatt]

C++ code: int height(Node* root) { if(root==NULL || root->left==NULL && root->right==NULL) { return 0; } int left = height(root->left); int right = height(root->right); if(left>right) { return left+1; } else { return right+1; } } The height of a node is the number of edges on the longest path between that node and a leaf. The level of a node is defined as: 1 + the number of edges between the node and the root.

[@prinsedits]

thankyou so much sir for such a detailed explanation

[@abdelrhmanahmed1378]

int find_height(BstNode* root) { if (root == NULL) return -1; else return max(find_height(root->left), find_height(root->right)) + 1; } you need to return -1 ,because last recursion on the leaf node must return 0 ,because the height of the leaf node is 0 so max(-1,-1) +1 --> will evaluate to 0 and for those who are intelligence enough will realize that when we return to the root node after we finish the left recursion the height will be shorter by one ,that one will get added after we finish the right sub-tree if the right sub-tree is shorter that the left so that one that get added will get the us right height ,and vice versa if the right height is longer

[@abdelrhmanahmed1378]

and by the way the definition of tree height is the max edges from the root to the longest path to the leaf ,so its not 4 or 5 there is only one right answer which is 4 for this example

[@RN-jo8zt]

Def: The height of a node in a binary tree is the largest number of edges in a path from a leaf node to a target node but why we still adding 1?

[@vijaysagoo2464]

Thank you for the in-depth explanation

[@mdanishossain026]

Tremendous explainatio sir, ❤from BD

[@bryanlee5522]

Thank you, I understand after seeing step by step

[@juhisingh4509]

Very good explaination of recursion ...Thanku sir

[@nitinmonga6975]

Very well explained sir.. Thank you so much

[@yasirshaikhkhan6189]

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

[@waynegreen7970]

Good content! Detailed and precise explanation!

[@aditi_jha]

Best explanation ever!!!!

[@ShreyasGaonkar]

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 :)

[@chauhanrachit]

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

[@preetichauhan3272]

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

[@shivamkeshri]

Item 😚

[@shreyasangane3822]

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

[@ashishchaudhari8223]

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

[@vivekmit]

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 ?

[@tumble_dont_fall]

best explanation on the internet

[@prashanthchinthilla3968]

By this i learned recursion too thanks:)

[@SICSSonamSharma]

Amazing explanation!

[@jitendragupta4661]

The best explanation！Keep posting！

[@JasPer22996]

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

[@iasaspirant1441]

In code everything is correct but return value is -1 so we get height of binary tree is equal to 4 not 5

[@Gudsan]

very nice explanation sir

[@gauravbhagat8831]

Got in one go thank you Vivekanand !

[@JULIUSNGIGIux]

Please update this video with the correct information. The height of a binary tree is the number of edges in the longest path from the root to the leaf, not the number of nodes from the root to the leaf.

[@adarshlakshmanan]

The height of the tree is calculated wrong. Counting the edges, the height is 4, not 5. This is how you correct it: In the program, if (p==null){ return -1; //Instead of 0 as shown in the video. } This also make sense conceptually since the depth of a Null node is -1 & not 0.

[@sumanreddyg8245]

So for a NULL tree what is the height you want to return -1 ? I hope 0 is right answer, if zero is right then height is 5 not 4, for NULL tree both depth and height must return 0

[@2010aishwary]

in this way the height of the binary tree with only root node will be 1 but the actual height of binary tree with only root node is 0 ??

[@shilpitamedhi3204]

great explanation thank u sir

[@ArunKumar-gp2vq]

Thank you so much brother you are doing great job

[@mohamedelkayal8871]

Your videos have been very helpful

[@FamousEgyptboy]

Thank you sir for great explanation !

[@ashaykapoor613]

Thanks, buddy! It really Helped

[@revanth9272]

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

[@m_arslan_]

Thank you, sir! you really helped me

[@18ajai]

Very well Explained

[@ashwinsingh1731]

finally found what i needed ... thank you sir

[@vivekanandkhyade]

Welcome 👍

[@MrRimmy]

VERY GOOD EXPLAINATION

[@maazalam66]

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

[@coderajput1816]

no it is not working properly....if any mistake in my code then please comment i uploaded the code in my comment

[@sagarkolhe5927]

great job vivekanand....

[@100_bindusai8]

Easy to understand 😀😊

[@ranitsinha6424]

The height of this tree will be 4 not 5 .. please correct it. For more info please visit --->www.hackerrank.com/challenges/tree-height-of-a-binary-tree/problem

[@itis_beard_man2471]

Good, I understand this very easily thank you!

[@harshitraj4199]

finally mil hi gya.... thanks a lot

[@amangarg6531]

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

[@deepakborah8335]

Very good explanation.

[@shyamaharihar2425]

Thankyou so much , finally understood :)

[@codelover847]

Great explanation👍👍

[@SahrishAli-pd8hb]

great brother habibi!

[@jaysahu357]

very nice explaination sir

[@Anonymous-jt3yz]

Best Explanation Ever

[@jeezradz]

what is the time complexity for this???

[@DeepakGupta-pt5rv]

Sir,You are the best!!

[@saldanhakaren1]

really good videos, looking forward to more content

[@anandoganiya9070]

bro what to say far better than apna college

[@lokeshchennamchetty1019]

height doesn't include root node, so height of node is 4 not 5 ,need correction!!

[@viktoriabrandstadter2333]

Thx ..it is a brilliant explanation!

[@srilekha9177]

Thanks a ton. Clear explanation.