public ArrayList<ArrayList<integer> > Print(TreeNode pRoot) { ArrayList<ArrayList<integer>> res = new ArrayList<>(); if (pRoot == null) { return res; } // int D = Depth(pRoot); Queue<treenode> queue = new LinkedList<>(); queue.add(pRoot); int depth = 1; whil...