1372. Longest ZigZag Path in a Binary Tree

LeetCodeDynamic ProgrammingTreeDepth-First SearchBinary TreeOpen on judge ↗

You are given the root of a binary tree. A ZigZag path for a binary tree is defined as follow: - Choose any node in the binary tree and a direction (right or left). - If the current direction is right, move to the right child of the current node; otherwise, move to the left child. - Change the direction from right to left or from left to right. - Repeat the second and third steps until you ca

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI