1、递归: ArrayList<ArrayList<Integer>> list = new ArrayList<>(); public ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) { PrintExcute(pRoot,0); return list; } private void PrintExcute(TreeNode pRoot, int deep) { if(pRoot == null) { return; } if(deep >= lis...