Solution: Diameter of Binary Tree
Explore how to compute the diameter of a binary tree by applying the tree depth-first search pattern. Understand the difference between paths passing through and not passing through the root, and learn to implement an efficient recursive solution that measures height and diameter while traversing each node once.
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 .