Diameter of a Binary Tree (Code/ Algorithm)

Find the diameter of a binary tree. The number of nodes on the longest path in a binary tree is the diameter. This is a recursive code.

[irynasherepot]

This is a great video, perfect speed for someone new and with English second language. Thank you for making it so easy to understand!

[mareimorsy]

I watched 10s of videos which is explaining the same problem, your video is the only one that made me finally get it, You're an awesome teacher, keep going <3

[praveenchouhan]

your way of slow explanation is very effective and efficient as these recursive problems are understood best when someone explains slowly other wise its difficult to keep track of recursive call flows, so keep going the way you are and keeping sharing knowledge like you are doing now.

[opeyemijonah]

I appreciate your solution, it was the only one I could understand on this topic. FYI, I translated this to JavaScript. However, for the final result portion, I removed '+1' from the height equation in the diameter function because the height function already includes a +1 to the left or right tree. It passed all cases when I did that.

[pahehepaa]

Very good explanation! The other guys were confusing until I stumbled upon this guy's video.

[Adityasharma-oezp]

Sir you have perfect explanation for every can write your own book....you explain better than best books out there of data structures

[opeyemijonah]

You are blessed with teaching. I wish I had found this video earlier.

[jeezradz]

just wow! I was struggling so much and you made this crystal clear. Thankyou! Great video~!

[griffinbaker]

Implementation in JS..it works! Thank you sir.

function binaryTreeDiameter(tree) {
// Write your code here.
if (!tree) return 0;
const heightOfLeft = height(tree.left);
const heightOfRight = height(tree.right);
const heightOfNode = 1 + Math.max(heightOfLeft, heightOfRight);
const diameterLeft =
const diameterRight =
const pathThroughRoot = heightOfRight + heightOfLeft;
const maxDiameterBelow = Math.max(diameterLeft, diameterRight);
return Math.max(maxDiameterBelow, pathThroughRoot);
}

function height(tree) {
if (!tree) return 0;
const left = height(tree.left);
const right = height(tree.right);
return 1 + Math.max(left, right);
}

[AbhiKumar-yksr]

Sir Your explanation is nice , every person can easily understand

[jhanvibatra]

Best Explaination so far. Thankyou sir

[ChandraShekhar-bycd]

You Explain like a PRO..Thanks for such a detailed explanation!

[jacktrainer]

Most thorough explanation out there! Great job!

[elebs_d]

Thank youu. I was really struggling to understand this and you explained it beautifully

[pauldaviddavies]

Vivek, that is a great video. Great explanation that is very much personalized for everyone. Thank you!

[TheSridharraj]

Just one correction or making everyone aware. when calculating the height of the tree, you should include the root too. hence in the diameter math you can simply do

return, Math.max(lDiameter, rDiameter))

[aruneshsrivastava]

correct solution, other than the fact is maximum diameter could be number of edges in the path, not the number of nodes, in that case we don't have to add extra 1 to the heights

[kushagrashekhawat]

You are an awesome teacher! Keep up the good work.

[shreyasangane]

Khup Sunder Explain Kelat!!! Dhanyavad

[pratapkumarchandra]

this is the best explanation i was looking for u. thank u for making it so simple :)