Binary Tree Zigzag Level Order Traversal | Day 22 | [ July LeetCoding Challenge ] [ Leetcode #103 ]

preview_player
Показать описание
The day 22 problem in July Leetcoding Challenge. ( Binary Tree Zigzag Level Order Traversal ).

0:00 What is Binary Tree Zigzag Level Order Traversal?
0:50 Breadth-First Search
2:17 Depth-First Search

Check out our other popular playlists:

Problem statement:
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,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its zigzag level order traversal as:
[
[3],
[20,9],
[15,7]
]

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #interview #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
Рекомендации по теме
Комментарии
Автор

I hope you all are enjoying the July leetcoding challenge!!! Don't forget to leave a comment!!! Please like the video to support us!!!
Questions you might like:
Struggling in a question??
Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
join shbcf.ru