logo
Interview
    Interview Guide
    Coding Problems List
Sponsored: Coursera
Problems

Binary Tree Level Order Traversal II

Problem

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

Example

Given binary tree {3,9,20,#,#,15,7},

  3
 / \
9  20
  /  \
 15   7

return its bottom-up level order traversal as:

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

Solution

The same as Binary Tree Level Order Traversal except that we need to reverse the result array before returning.

Online Judge