Leetcode 2385. Amount of Time for Binary Tree to Be Infected

Given a binary tree and a start node, compute how many minutes it takes for an infection that spreads each minute to adjacent nodes (parent/children) to reach every node. This reduces to treating the tree as an undirected graph and finding the maximum distance (time) from the start node, e.g., via BFS.