Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Diameter of Binary Tree

Explore how to calculate the diameter of a binary tree by using depth-first search to measure subtree heights and update the maximum path. Understand the difference between paths passing through the root and those that do not, and learn the optimization that reduces time complexity to linear with respect to the number of nodes.

We'll cover the following...

Statement

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.

Constraints:

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