← Adobe questions
CodingReported in a candidate post, Aug 2019

Time taken by a binary tree to burn from a target node

Filed under Adobe

Given a binary tree where all nodes have unique values, and a target node, calculate the minimum time required to burn the entire binary tree starting from the target node. Fire spreads to left…

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 Adobe questions

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