Question 2

Write a function that accepts root of a binary tree and print zigzag level order traversal, each level print in new line.
For example,
Given tree:
1
2 3
4 5 6 7
8 9
output:
1
2 3
7 6 5 4
8 9

Ask Us How You Can Get Your First Dream Job 😉

Fill in the form below to book a 30 min no-obligation consulting session.

 

New Report

Close