非递归实现二叉树的遍历(二)
aram list * @return */ public static String listToString(LinkedList
list) { int[] arr = new int[list.size()]; int i = 0; for (TreeNode node : list) { arr[i] = node.val; i++; } return Arrays.toString(arr); } public static void main(String[] args) { TreeNode root = new TreeNode(1); root.left = new TreeNode(2); root.right = new TreeNode(3); root.left.left = new TreeNode(4); root.left.right = new TreeNode(5); System.out.println("前序：" + preorderTraversal(root).toString()); System.out.println("中序：" + inorderTraversal(root).toString()); System.out.println("后序：" + postorderTraversal(root).toString()); System.out.println("顺序：" + levelTraversal(root).toString()); System.out.println("K序：" + findLevelList2(root, 2)); } }