Code
The highlighted line runs next. The pill shows the live values in the running call.
Cost
Work done so far, and how the three solutions compare
The tree
Diameter = edges on the longest path
The highlighted line runs next. The pill shows the live values in the running call.
Work done so far, and how the three solutions compare
Diameter = edges on the longest path
Keyboard: ← → step, Space play or pause. Enter the tree in level order with null for missing children, as LeetCode does (1 to 13 nodes, 5 levels, values −100 to 100). The small badge on a node is the value the algorithm has worked out for it so far.