LC 102 层序遍历的变体:每次循环打印每一层内所有的点值注意:List<List> = new ArrayList<>(); Queue = new LinkedList<>(); //执行用时: 1 ms 内存消耗: 38.5 MB //队列+层序遍历 import java.util.*; class Solution { public List<List<Integer>> levelOrder(TreeNode root) { List<List<Integer>> a=new ArrayList<>(); if (root==null)return a; Queue<TreeNode> queue=new LinkedList<TreeNode>(); queue.offer(root); while(!queue.isEmpty()){ int l=queue.size(); List<Integer> atmp=new ArrayList<>(); while(l>0){ TreeNode tmp=queue.poll(); atmp.add(tmp.val); if(tmp.left!=null)queue.offer(tmp.left); if(tmp.right!=null)queue.offer(tmp.right); l--; } a.add(atmp); } return a; } }