LeetCode-102:二叉树的层序遍历(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 {
    public List<List<Integer>> levelOrder(TreeNode root) {
        if (root == null) {
            return new LinkedList<>();
        }
        List<List<Integer>> list1 = new ArrayList<>();
        Queue<TreeNode> que = new LinkedList<>();
        que.add(root);
        while (!que.isEmpty()) {
            int size = que.size();
            List<Integer> list2 = new ArrayList<>();
            for (int i = 0; i < size; i++) {
                TreeNode t = que.poll();
                list2.add(t.val);
                if (t.left != null) {
                    que.add(t.left);
                }
                if (t.right != null) {
                    que.add(t.right);
                }

            }
            list1.add(list2);
        }
        return list1;
    }
}