🧠 Before you code — what pattern fits?
A ZigZag path starts at any node, moves to a child, then keeps alternating direction (left, right, left, …). The length is the number of nodes visited − 1. Given the root of a binary tree, return the longest ZigZag path length.
[1,null,1,1,1,null,null,1,1,null,1,null,null,null,1] → 3
[1,1,1,null,1,null,null,1,1,null,1] → 4
🎬 Video explanation · codestorywithMIK
Your solution runs against 3 unit tests, including edge and large-value cases.
Loading...
Test console · 3 unit tests
Submit your code to run it against all 3 unit tests. Results appear here.
JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.