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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

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

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact