CodingMediumcod-g772

Subject Binary treesLevel Mid–Senior~18 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a binary tree as a level-order array (null for missing), return the length of its diameter measured in EDGES — the number of edges on the longest path between any two nodes, which need not pass through the root. An empty tree has diameter 0 and a single node has diameter 0.

Implement

tree_diameter(level: list) → int

Examples

in[[1,2,3,4,5]]out3

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.