Given an n-ary tree (a connected acyclic graph), find the maximum distance between any two nodes. The distance is defined as the number of edges in the shortest path between them.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.