Live Batches
Masterclasses
Menu
Free Courses
Account
Login / Sign Up

Binary Tree Zigzag Level Order Traversal

Medium Acceptance 71.48% Points 30.00

You are given the root of a binary tree. Your task is to return the zigzag level order traversal of the tree

Examples
Example 1

image Input: root = [3,9,20,null,null,15,7]
Output: [[3],[20,9],[15,7]]
Explanation: The traversal alternates between left-to-right and right-to-left at each level.

Example 2

image Input: root = [1]
Output: [[1]]
Explanation: The tree contains only one level.

Example 3

image Input: root = []
Output: []
Explanation: The tree is empty.

Constraints
    • 0 = Number of nodes = 105
    • -10? = Node.data = 10?
Companies
Samsung Zomato
Topics
Tree Recursion Traversal + 1 more
Solution.cs C#JavaPythonC++Javascript

Unlock the code editor

Sign in to write, run, and submit your solution against the full test suite.

  • Run code against sample & hidden test cases
  • Save submissions and track your streak
  • Compare with editorial & community solutions