binary_tree_level_order_traversal_ii

README

< Previous 　　　　　　　　　　　　　　　　 Next >

107. Binary Tree Level Order Traversal II (Easy)

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).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

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

Related Topics

[Tree] [Breadth-first Search]

Similar Questions

1. Binary Tree Level Order Traversal (Medium)
2. Average of Levels in Binary Tree (Easy)