二叉搜索树的插入，前序，中序，后续遍历和打印

分享一个慕课网的算法，二叉树的打印，输出和插入

public class BST1<E extends Comparable<E>> {
    private class Node {
        public E e;
        public Node left, right;

        public Node(E e) {
            this.e = e;
            left = null;
            right = null;
        }
    }

    private Node root;
    private int size;

    public BST1() {

    }

    /**
     * 求二叉树的节点的个数
     *
     * @return
     */
    public int getSize() {
        return size;
    }

    /**
     * 判断二叉树是否为空
     */
    public boolean isEmpty() {
        return size == 0;
    }

    /**
     * 向二叉树中插入元素
     */
    public Node add(E e) {
        root = add(root, e);
        return root;
    }

    /**
     * 向搜索二叉树中插入元素
     *
     * @param node
     * @param e
     * @return
     */
    public Node add(Node node, E e) {
        if (node == null) {
            size++;
            return new Node(e);
        }
        if (e.compareTo(node.e) < 0)
            node.left = add(node.left, e);
        if (e.compareTo(node.e) > 0)
            node.right = add(node.right, e);
        return node;
    }

    /**
     * 二叉搜索树的中序遍历
     */
    public void inOrder() {
        inOrder(root);

    }

    public void inOrder(Node node) {
        if (node == null)
            return;
        inOrder(node.left);
        System.out.print(node.e+" ");
        inOrder(node.right);
    }

    /**
     * 二叉树的前序遍历
     */
    public void preOrder() {
        preOrder(root);
    }

    public void preOrder(Node node) {
        if (node==null)
            return;
        System.out.print(node.e+" ");
        preOrder(node.left);
        preOrder(node.right);
    }

    /**
     * 二叉树的后序遍历
     */
    public void postOrder() {
        postOrder(root);
    }

    public void postOrder(Node node) {
        if (node==null)
            return;
        postOrder(node.left);
        postOrder(node.right);
        System.out.print(node.e+" ");
    }

    @Override
    public String toString() {
        StringBuilder res=new StringBuilder();
        generateString(root,0,res);
        return res.toString();
    }
    public void generateString(Node node,int  depth,StringBuilder res)
    {
        if (node==null){
            res.append(generateDepth(depth)+"null\n");
            return;
        }
        res.append(generateDepth(depth) + node.e + "\n");
        generateString(node.left, depth + 1, res);
        generateString(node.right, depth + 1, res);
    }
    public String generateDepth(int depth) {
        StringBuilder res = new StringBuilder();
        for (int i = 0; i < depth; i++) {
            res.append("--");
            System.out.printf("");
        }
        return res.toString();
    }

}

测试类的代码如下:
 

public class Test {
    public static void main(String[] args) {
        BST1 bst1 = new BST1();
        bst1.add(5);
        bst1.add(3);
        bst1.add(6);
        bst1.add(8);
        bst1.add(4);
        bst1.add(2);

        //System.out.println(bst1.isEmpty());
        //System.out.println(bst1.getSize());
        bst1.inOrder();
        System.out.println();
        bst1.preOrder();
        System.out.println();
        bst1.postOrder();
        System.out.println();
        System.out.println(bst1.toString());
    }
}