# Leetcode 107 - Binary tree level order traversal II

Note:

• Very similar to Leetcode 102, but we just need to reverse the result.

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

Example