_i in the tree.

Return the diameter of the tree.

Example 1:

Input: edges = [[0,1],[0,2]]
Output: 2
Explanation: The longest path of the tree is the path 1 - 0 - 2.

Example 2:

Input: edges = [[0,1],[1,2],[2,3],[1,4],[4,5]]
Output: 4
Explanation: The longest path of the tree is the path 3 - 2 - 1 - 4 - 5.

Constraints:

n == edges.length + 1
1 <= n <= 10⁴
0 <= a_i, b_i < n
a_i != b_i

23:T72b,**Explain:**\n- Similar problem: https://leetcode.com/problems/diameter-of-binary-tree/\n- Travese all the nodes of the tree. The diameter of the tree is maximum of the longest path through each node.\n- Longest path through a node is sum of top 2 depths of children\'s tree.\n\n**Java ~ 5ms**\n```java\nclass Solution {\n int diameter = 0;\n public int treeDiameter(int[][] edges) {\n int n = edges.length + 1;\n List[] graph = new List[n];\n for (int i = 0; i < n; ++i) graph[i] = new LinkedList<>();\n for (int[] e : edges) {\n graph[e[0]].add(e[1]);\n graph[e[1]].add(e[0]);\n }\n diameter = 0;\n depth(0, -1, graph);\n return diameter;\n }\n // Depth of the tree is the number of nodes along the longest path from the root node down to the farthest leaf node.\n int depth(int root, int parent, List[] graph) {\n int maxDepth1

Tree Diameter

Problem Description

Problem Description

Answer Panel