Leetcode 543. Diameter of Binary Tree

Given the root of a binary tree, return the diameter — the maximum number of edges on any path between two nodes; the core challenge is to compute subtree heights and track the maximum sum of left and right heights at each node in a single O(n) traversal.

Asked at:

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late November, 2025

Meta

Senior

Early November, 2025

Meta

Mid-level

Early August, 2025

Meta

Senior

Get Premium to View All 20+ Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 543. Diameter of Binary Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact