赵二的刷题日记021《层序遍历二叉树》

Binary Tree Level Order Traversal

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

Example 1:

Input: root = [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Example 2:

Input: root = [1]
Output: [[1]]

Example 3:

Input: root = []
Output: []

 

/**
 * 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) {
        Queue<TreeNode> qq = new LinkedList();
        List ress = new LinkedList();//用于放置每一个res
        
        if (root == null)
            return ress;
        
        qq.add(root);
        while (!qq.isEmpty()) {
            List res = new LinkedList();//用于放置每一层的val
            int curSize = qq.size();
            for (int i = 0; i < curSize; i++) {
                TreeNode node = qq.remove();
                res.add(node.val);
                
                if (node.left != null) {
                    qq.add(node.left);
                }
                if (node.right != null) {
                    qq.add(node.right);
                }
            }
            ress.add(res);
        }
        return ress;
    }
}