剑指offer_java_utils

public class Node {

    public int value;
    public Node next;

    public Node() {
    }

    Node(int value) {
        this.value = value;
    }

    public static Node getNode1(int n) {
        Node head = new Node(-111);
        Node tail = head;
        for (int i = 0; i < n; i = i + 2) {
            Node node = new Node(i);
            tail.next = node;
            tail = node;
        }
        return head;
    }

    public static Node getNode2(int n) {
        Node head = new Node(-222);
        Node tail = head;
        for (int i = 1; i < n; i = i + 2) {
            Node node = new Node(i);
            tail.next = node;
            tail = node;
        }
        return head;
    }

    public static void show(Node node) {
        while (node != null) {
            System.out.print(node.value+" ");
            node = node.next;
        }
        System.out.println();
    }
}

public class Tree {

    public int value;
    public Tree left;
    public Tree right;

    public Tree() {
    }

    public Tree(int value) {
        this.value = value;
    }

    public static Tree creat(Tree root) {
        Scanner in = new Scanner(System.in);
        int n;
        n = in.nextInt();
        if (n == 0)
            return null;
        else {
            root = new Tree(n);
            root.left = creat(root.left);
            root.right = creat(root.right);
        }
        return root;
    }

    public static void show(Tree root) {
        if (root == null)
            return;
        show(root.left);
        System.out.print(root.value + " ");
        show(root.right);
    }
}