[leetcode-二叉树层次遍历并统计每层节点数]--107. Binary Tree Level Order Traversal II

Question 107. Binary Tree Level Order Traversal II

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

中文：二叉树层次遍历并统计每层结点。这里和102题的区别在于，这里每层的输出是倒序的，也就是从最后一层向上输出直到根节点。

这一题和102解决思路差不多，不过这里使用大了stack来存储每层结点的list达到目的。