Binary Tree Level Order Traversal
Updated
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) → List<List<Integer>>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
0and10000nodes. - Node values fit in a signed 32-bit integer.
More Atlassian Online Assessment questions
- Planning ProductionOA · Seen Feb 2025
- K-Means ClusteringOA · Seen Feb 2025
- Minimum Sorted Erasure OperationsOA · Seen Jun 2024
- Count Analogous ArraysOA · Seen Mar 2024
- Get Maximum ScoreOA · Seen Mar 2024
- Better Compression 🦀OA · Seen Mar 2024
- Romanizer 🐡OA · Seen Mar 2024
- Flower Bouquets 💐OA · Seen Mar 2024
- Binary Search Tree IteratorOA · Seen Nov 2023
- Design HashMapOA · Seen Nov 2023
Similar questions at other companies
- Minimum-Sum Tree Fill with Unit StepsVisa · OAVisa interview questions
- Minimum N-ary Tree Depth DeletionsSnowflake · OA · PHONE SCREENSnowflake interview questions
- Tree Pythagorean TriplesIBM · OAIBM interview questions
- Count LevelsBlackRock · OABlackRock interview questions
- Maximum Data Transfer TimeMicrosoft · OAMicrosoft interview questions
- Longest Transfer Time in a Server TreeRippling · OARippling interview questions
- TikTok: Secondary InfluencersTikTok · OATikTok interview questions
- Find Min Distance to Furthest Node (Google Tokyo)Google · OAGoogle interview questions
- Binary Tree Level OrderMorgan Stanley · OAMorgan Stanley interview questions
- Binary Tree Right ViewPinecone · OA