Solution: Tree Diameter

Explore how to find the diameter of an undirected tree by applying depth-first search traversal. Understand the concept of longest paths between nodes and how to compute these by tracking two longest distances from each node. Learn to build adjacency lists, perform DFS with a visited list, and update the maximum diameter efficiently using a single traversal. This lesson helps you grasp a core graph algorithm pattern relevant for coding interviews.