Binary Tree Zigzag Level Order Traversal - Coddicted

Binary Tree Zigzag Level Order Traversal

Title: Binary Tree Zigzag Level Order Traversal Source: leetcode.com

Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree {3,9,20,#,#,15,7},

return its zigzag level order traversal as:

Python solution


Back To Top
Rate this post

Leave a Reply