Tree Node with Maximum Depth / Binary Tree Traversal

CodingRobloxLast reported November 2025Medium Frequency
Reported
4× across candidate reports
First seen
October 2025
Last reported
November 2025
Reported outcome
mixed

Problem Overview

A multi-part binary tree problem observed in two variants: Variant A (Q2/Q3 series): Q2: Given a binary tree, return the node with the maximum depth. If multiple nodes share the same maximum depth, return the first one encountered (first occurrence in traversal order). Interviewer also asks about time complexity. Q3:…

  • 3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
  • The rest of the problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Roblox catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Roblox question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?