LeetCode 102. Binary Tree Level Order Traversal

问题描述

• Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
• 地址

问题分析

• 该题同 剑指offer-把二叉树打印成多行 一样，实现二叉树的层序遍历。

代码实现

/**
 * 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>> levelOrder(TreeNode root) {
        if (root == null) {
            return new ArrayList<>();
        }
        LinkedList<TreeNode> queue = new LinkedList<>();
        List<List<Integer>> res = new ArrayList<>();
        queue.add(root);
        while (! queue.isEmpty()) {
            int levelSize = queue.size();
            List<Integer> levelList = new ArrayList<>();
            for (int i = 0; i < levelSize; i++) {
                TreeNode popNode = queue.remove();
                levelList.add(popNode.val);
                if (popNode.left != null) {
                    queue.add(popNode.left);
                }
                if (popNode.right != null) {
                    queue.add(popNode.right);
                }
            }
            res.add(levelList);
        }
        return res;
    }
}