【LeetCode 107. Binary Tree Level Order Traversal II】（已知层次遍历输出后序遍历，BFS）

题目链接

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

题意：给定二叉树的层次遍历序列，输出后序遍历序列。

思路：比较容易想到的是BFS，参考了discuss部分。

代码：

/**
 * Definition for a binary tree node. public class TreeNode { int val; TreeNode
 * left; TreeNode right; TreeNode(int x) { val = x; } }
 */
class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        if (root == null) {
            return Collections.emptyList();
        }
        LinkedList<List<Integer>> res = new LinkedList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            int num = queue.size();
            List<Integer> levelTraversal = new ArrayList<>();
            for (int i = 0; i < num; i++) {
                TreeNode node = queue.poll(); //移除并返回队头元素，如果队列为空则返回null
                levelTraversal.add(node.val);
                if (node.left != null) {
                    queue.offer(node.left);///添加元素到队头并返回true
                }
                if (node.right != null) {
                    queue.offer(node.right);
                }
            }
            res.addFirst(levelTraversal);//添加到开头
        }
        return res;
    }
}

参考：
java中queue的使用