Back to course home

0% completed

Problem Challenge 1: Tree Diameter (medium)

## Problem Statement

Given a binary tree, find the length of its diameter. The diameter of a tree is the number of nodes on the **longest path between any two leaf nodes**. The diameter of a tree may or may not pass through the root.

Note: You can always assume that there are at least two leaf nodes in the given tree.

**Constraints:**

- n == edges.length + 1
- 1 <= n <= 10<sup>4</sup>
- 0 <= a<sub>i</sub>, b<sub>i</sub> < n
- a<sub>i</sub> != b<sub>i</sub>

## Try it yourself

Try solving this question here:

Python3

Python3

. . .

Mark as Completed