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

Solution: Binary Tree Zigzag Level Order Traversal — BFS Deque Approach We can solve this problem using **Breadth-First Search (BFS)**. We process nodes level by level. To implement the zigzag effect, we can use a double-ended queue (LinkedList in Java acting as a Deque) to store the values of each level: We maintain a boolean flag leftToRight to track the current direction. At each level, we find the number of nodes at that level (the size of our queue). When ...