Diameter of Binary Tree — Easy Coding Interview Question

Given the root of a binary tree, return the length of the diameter of the tree — the length (in edges) of the longest path between any two nodes, which may or may not pass through the root.

Example

Input: root = [1,2,3,4,5]

Output: 3

Constraints

• The number of nodes is in the range [1, 10⁴]
• -100 ≤ Node.val ≤ 100

Topics & Companies

Topics: trees

Asked by: Amazon, Meta, Microsoft

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(h).

Practice more

• All DSA Problems
• DSA Patterns