[Java] Leetcode 543. Diameter of Binary Tree [Binary Tree #11]

In this video, I'm going to show you how to solve Leetcode 543. Diameter of Binary Tree which is related to Binary Tree.
In fact, I also have a whole section of solving leetcode questions and categorize them: www.youtube.co...
In the end, you’ll have a really good understanding on how to solve Leetcode 543. Diameter of Binary Tree and questions that are similar to this Binary Tree.
Now, if you want to get good at Binary Tree, please checkout my Binary Tree playlist. • Leetcode: Binary Tree
💻 Code: github.com/Eri...

[@shinex315]

Outstanding vedio ! Deserve more whatching

[@chigozie_jesse]

Thanks, this is the best explanation so far for me.

[@pedrohenriqueleite9382]

I think we should put OR on RIGHT and LEFT when use the if for simplify the code

[@filsgarage]

Great video. Thanks!

[@EricProgramming]

Glad you liked it!

[@MianyunNi]

I still cannot understand, we are asking to get the path, why we need add the root.left and root.right together,

[@DxDy777]

1st

[@EricProgramming]

tao chen, Thank you very much for your support!