Solution: Minimum Height Trees

Statement

You are given $n$ as the number of nodes and a 2D array of edges representing a tree having the following properties:

• It is an acyclic, undirected graph containing $n$ nodes and $n-1$ edges.

• The nodes are labeled from $0$ to $n-1$.

• An edge at the $i^{th}$ index is represented as $[a_i, b_i]$, which denotes that there is an undirected edge connecting the nodes $a_i$ ...