折纸问题(二叉树的中序遍历)

public class PaperFolding {
  public static void printAllFolds(int N) { printProcess(1, N, true); }
  public static void printProcess(int i, int N, boolean down) {
    if (i > M) {
      return;
    }
    printProcess(i + 1, N, true);
    System.out.println(down ? "down" : "up");
    printProcess(i + 1, N, false);
  }
}