102. Binary Tree Level Order Traversal | 层序遍历 /** * 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<>(); if(root==null) return res; Queue<TreeNode> q = new LinkedList<>(); q.offer(root); while(!q.isEmpty()) { int level = q.size(); List<Integer> list = new LinkedList<>(); for(int i=0; i<level; i++) { TreeNode node = q.poll(); list.add(node.val); if(node.left!=null) q.offer(node.left); if(node.right!=null) q.offer(node.right); } res.add(list); } return res; } }