+20 XP Reward
Binary Tree Level Order Traversal
Solved
DSA
•64% Acceptance Rate•14,560 SubmissionsGiven 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].
Related Topics:
Tree
BFS
Binary Tree
Console Output
Click "Run Test Cases" to test with public inputs or "Submit Solution" to run full evaluation suite.