ailands的专栏

递归遍历：public void preOrder() { // TODO Auto-generated method stub System.out.print("先根次序遍历二叉树："); preOrder(root); System.out.println(); } public void preOrder(BinaryNode p) { if (p != null

全排列算法private int count=0; public void perm(int[] list, int k, int m) { if (k == m) { for (int i = 0; i < list.length; i++) { System.out.print(list[i] + " "); } count++; System.o