Solution: Diameter of Binary Tree
Explore how to find the diameter of a binary tree by calculating the longest path between any two nodes using depth-first search. Understand both naive and optimized approaches, evaluate their time complexities, and implement an efficient solution that computes diameter in O(n) time by combining subtree heights and diameters.
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 .