Dsa
Trees
Easy
Binary Tree Level Order Traversal
You are tasked with traversing a binary tree in level order. Write a method that prints the values of the nodes at each level from top to bottom. The input is represented as a space-separated string of integers where 'null' represents no node.
Example:
Input:
1 2 3 null null 4 5
Output:
1
2 3
4 5
Key concepts
treestraversalbfs
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now