Morgan Stanley OA Question 2024 July | Trees & BFS | on-campus

Question: Binary Tree Zigzag Level Order Traversal Problem Statement Given the root of a binary tree, return the zigzag level order traversal of its nodes' values (i.e., from left to right, then right to left for the next level, and alternate between). Constraints The number of nodes in the tree is in the range [0, 2000]. -100 <= Node.val <= 100 Examples Example 1: Input: root = [3,9,20,null,null,15,7] Output: [[3],[20,9],[15,7]] Explanation 1: Level 0: [3] (Left to Right) Level 1: ...