二叉搜索树

package tree;
/**
 * 二叉排序树
 * @author MacBook
 *
 */
public class tree1 {
    private treeNode root;
    public treeNode getRoot(){
        return root;
    }
    public void insertNode(treeNode n){
        treeNode parent = root;
        treeNode son = root;
        if(root == null){
            root = n;
            return;
        }
        while(son != null){
            parent = son;
            if(n.getData()>son.getData())
                son = son.getRight();
            else
                son = son.getLeft();
        }
        if(parent.getData()>n.getData())
            parent.setLeft(n);
        else 
            parent.setRight(n);
    }
    //前序遍历
    public void print1(treeNode n){
        if(n!=null)
        {
            System.out.println(n.getData());
            print1(n.getLeft());
            print1(n.getRight());
            
        }
    }
    //中序遍历
    public void print2(treeNode n){
        if(n!=null)
        {
            print2(n.getLeft());
            System.out.println(n.getData());
            print2(n.getRight());
        }
    }

    //后序遍历
    public void print3(treeNode n){
        if(n!=null)
        {
            print3(n.getLeft());
            print3(n.getRight());
            System.out.println(n.getData());
        }
    }

    public static void main(String[] args) {
        tree1 t = new tree1();
        treeNode n1 = new treeNode();
        n1.setData(7);
        treeNode n2 = new treeNode();
        n2.setData(5);
        treeNode n3 = new treeNode();
        n3.setData(9);
        treeNode n4 = new treeNode();
        n4.setData(3);
        treeNode n5 = new treeNode();
        n5.setData(6);
        treeNode n6 = new treeNode();
        n6.setData(11);
        treeNode n7 = new treeNode();
        n7.setData(8);
        t.insertNode(n1);
        t.insertNode(n2);
        t.insertNode(n3);
        t.insertNode(n4);
        t.insertNode(n5);
        t.insertNode(n6);
        t.insertNode(n7);
        t.print3(t.getRoot());
    }
}
class treeNode{
    private int data;
    private treeNode left;
    private treeNode right;
    public int getData() {
        return data;
    }
    public void setData(int data) {
        this.data = data;
    }
    public treeNode getLeft() {
        return left;
    }
    public void setLeft(treeNode left) {
        this.left = left;
    }
    public treeNode getRight() {
        return right;
    }
    public void setRight(treeNode right) {
        this.right = right;
    }
    
}