Samsung OA Question 2024 August | Trees & BFS | on-campus

Question: Binary Tree Level Order Traversal Problem Statement Given the root of a binary tree, return the level order traversal of its nodes' values (i.e., from left to right, level by level). Constraints The number of nodes in the tree is in the range [0, 2000]. -1000 <= Node.val <= 1000 Examples Example 1: Input: root = [3,9,20,null,null,15,7] Output: [[3],[9,20],[15,7]] Explanation 1: Level 0 contains only the root [3]. Level 1 contains its children [9, 20]. Level 2 contains the ...