Diameter of Binary Tree

Try to solve the Diameter of Binary Tree problem.


Given a binary tree, you need to compute the length of the tree’s diameter. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Note: The length of the path between two nodes is represented by the number of edges between them.


  • The number of nodes in the tree is in the range [1,500][1, 500].
  • 100-100 \leq Node.value 100\leq 100


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy