Solution: Tree Diameter

Statement

Given an undirected treeAn undirected tree is a connected, acyclic graph where edges have no direction, meaning they can be traversed in both directions. with $n$ nodes labeled from $0$ to $n - 1$, represented by a 2D array edges where $edges.length == n - 1$. Each $edges[i] = [a_i, b_i]$ ...