Tree diameter edges
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) → intExamples
in
[[1,2,3,4,5]]out3What 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.
0:00 of about 18 min
solution.py
InputExpectedGot
[[1,2,3,4,5]]3not run yetsample