题目描述从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。示例1输入{8,6,10,5,7,9,11}返回值[[8],[6,10],[5,7,9,11]] ArrayList<ArrayList<Integer> > Print(TreeNode root) { ArrayList<ArrayList<Integer>> res = new ArrayList(); if(root==null) return res; Queue<TreeNode> queue= new LinkedList(); queue.offe...