How should I practice Binary Tree Level Order Traversal?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen and onsite interview problems in FastPrep.

Is Binary Tree Level Order Traversal associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen and onsite interview coding practice problem when the problem catalog has that company and stage context.

Binary Tree Level Order Traversal

Bloomberg LP● MediumNEW GRADPHONE SCREENONSITE INTERVIEW

Learn

Problem statement

Return the tree values level by level from top to bottom. Within each level, list nodes from left to right.

Function

levelOrder(root: TreeNode) → int[][]

Examples

Example 1

root = [3,9,20,null,null,15,7]return = [[3],[9,20],[15,7]]

The root forms level zero, followed by its children and then the final two grandchildren.

Constraints

The tree contains between 0 and 10000 nodes.
Node values fit in a signed 32-bit integer.