LeetCode 102. Binary Tree Level Order Traversal【Java】

题目描述

二叉树的层次遍历

AC代码

/**
 * 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) {
        List<List<Integer>> res=new LinkedList<>();
        Queue<TreeNode> queue=new LinkedList<>();
        if(root==null)
            return res;
        queue.offer(root);

        while(queue.size()>0){
            List<Integer> level=new LinkedList<>();
            int n=queue.size();
            for(int i=0;i<n;i++){
                TreeNode p=queue.peek();
                queue.poll();
                level.add(p.val);
                if(p.left!=null) queue.offer(p.left);
                if(p.right!=null) queue.offer(p.right);
            }
            res.add(level);
        }
        return res;
    }
}