LC 107. 二叉树的层序遍历 II

题目描述

给定一个二叉树，返回其节点值自底向上的层序遍历。 （即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）

例如：
给定二叉树 [3,9,20,null,null,15,7],

样例

    3
   / \
  9  20
    /  \
   15   7

返回其自底向上的层序遍历为：

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

---

Java 代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    List<List<Integer>> list = new ArrayList<>();
    TreeNode[] q = new TreeNode [10005];
    int hh = 0, tt = -1;
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        if (root == null) return list;
        q[ ++ tt] = root;
        while (hh <= tt) {
            List<Integer> level = new ArrayList<>();
            int len = tt - hh + 1;
            while (len > 0) {
                TreeNode tn = q[hh ++ ];
                len -- ;
                level.add(tn.val);
                if (tn.left != null) q[ ++ tt] = tn.left;
                if (tn.right != null) q[ ++ tt] = tn.right;
            }
            list.add(level);
        }
        Collections.reverse(list);
        return list;
    }
}