FastPrepBinary Tree Level Order Traversal
Problems/Binary Tree Level Order Traversal

Binary Tree Level Order Traversal

Atlassian logoAtlassian● MediumFULLTIMEOA

Updated Nov 2026

QuestionFunctionExamplesConstraints

Problem statement

Source note: Reported in an Atlassian full-time online assessment. The report links to the exact Binary Tree Level Order Traversal exercise but does not copy its full statement. Our version follows that linked exercise and uses a fixed function interface.

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]]
root
3920157

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.

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

Atlassian interview experiences

  • Atlassian MLE Phone Screen: Model Deployment Design: 1 Experience
  • Atlassian Coding Screens and Karat: 3 Experiences (Part 2 of 2)
  • Atlassian Full Stack Interviews: 11 Experiences (Part 1 of 2)
All Atlassian interview questionsSee Atlassian hiring insights
Saved
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
      // Write your code here.
    }

}
Checking account…