Compute binary tree diameter
Overview
This question evaluates understanding of binary tree structures, computation of path-based metrics (diameter), handling edge cases such as empty or single-node trees, and the ability to analyze time and space complexity.
Meta
Aug 7, 2025, 12:00 AM
Software Engineer
Technical Screen
Coding & Algorithms
0
0
Given the root of a binary tree, compute the tree's diameter defined as the maximum number of edges on any path between two nodes. Return the diameter, explain whether paths must pass through the root, and provide a solution with time and space complexity analysis. Handle empty and single-node trees.