Level Order

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

Example :
Given binary tree

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

Also think about a version of the question where you are asked to do a level order traversal of the tree when depth of the tree is much greater than number of nodes on a level.

Interview Code Editor
Hints
  • Solution Approach
  • Complete Solution
3307 successful submissions.
Asked In:
  • Facebook
  • Groupon
Click here to jump start your coding interview preparation