Diameter of Binary Tree

Given the root of a binary tree, return the length of the diameter of the tree. The diameter is the length of the longest path between any two nodes in the tree. This path may or may not pass through the root. The length of a path is the number of edges between two nodes.

Constraints

  • The number of nodes in the tree is in the range [1, 10^4].
  • -100 <= Node.val <= 100
View editorial solution
Saving… · 9 lines
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right

class Solution:
def diameterOfBinaryTree(self, root: TreeNode) -> int:
Console

Click Run to execute sample tests.