高分！！建立一颗树，每个节点采用数字显示，遍历树

高分！！建立一颗树，每个节点采用数字显示，遍历树.谢谢

[code="java"]public class TreeSort {

static class Entry {
    int value;
    Entry left;
    Entry right;

    Entry(int value) {
        this.value = value;
        left = null;
        right = null;
    }
}

static void visit(Entry V) {
    System.out.print(V.value + " ");
}

static void mSort(Entry n) {
    if (n != null) {
        mSort(n.left);
        visit(n);
        mSort(n.right);
    }
}

public static void main(String[] args) {
    Entry root = new Entry(15);
    Entry n1 = new Entry(34);
    Entry n2 = new Entry(14);
    Entry n3 = new Entry(46);
    Entry n4 = new Entry(38);
    Entry n5 = new Entry(83);
    Entry n6 = new Entry(2);
    Entry n7 = new Entry(155);
    Entry n8 = new Entry(1535);
    root.left = n1;
    root.right = n2;
    n1.left = n3;
    n1.right = n4;
    n2.left = n5;
    n2.right = n6;
    n6.left = n7;
    n7.right = n8;

    mSort(root);

}

}[/code]

中序遍历，可以很容易的改成前序或是后序遍历。