Binary Tree Diameter Problem Statement

Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is represented by the number of edges between these nodes.

Example:

Input:

1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1

Output:

6

Explanation:

For the provided binary tree, the longest path between two leaf nodes results in a diameter length of 6. Nodes in this path have been highlighted.

Constraints:

• 1 <= T <= 10
• 0 <= N <= 105
• 1 <= data <= 104
• The time limit is 1 second.