How should I practice Leaf-to-Leaf Binary Tree Diameter?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon onsite interview problems in FastPrep.

Is Leaf-to-Leaf Binary Tree Diameter associated with Amazon?

FastPrep tags this as a Amazon onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Tree

Leaf-to-Leaf Binary Tree Diameter

● Medium

AmazonFULLTIMEONSITE INTERVIEW

See Amazon hiring insights

Problem statement

Given the root of a binary tree, return the maximum number of edges on a simple path between two distinct leaves.

The problem statement continues

Pro

Examples

Example 1

root = [1,2,3,4,5,null,6]return = 4

The path from leaf 4 to leaf 6 is 4 -> 2 -> 1 -> 3 -> 6, which contains four edges.

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week