← Goldman Sachs questions
CodingReported in a candidate post, Aug 2021

Minimum time required to burn the tree

Filed under Goldman Sachs

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.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.