NeetCode #434LC-103MediumTrees
← Back to All Problems#434 · #103 · Binary Tree Zigzag Level Order Traversal(二叉树的锯齿形层序遍历)
📌 Problem Statement & Constraints
Given the root of a binary tree, return its zigzag level-order traversal: levels alternate between left-to-right and right-to-left, starting with left-to-right. Constraints: the number of nodes is in
[0, 2000], -100 <= Node.val <= 100.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!