Given a binary tree and a target node, find the minimum time required to burn the entire tree. Fire spreads from the target node to its neighbors (parent, left child, right child) every unit of time.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.