二叉树的先序 中序 后序遍历

根->左->右

	public void preOrder() {
        System.out.print("二叉树的先序遍历序列：");
        this.preOrder(root);
    }
    private void preOrder(BTNode t) {
        if (t != null) {
            System.out.print(t.data);
            this.preOrder(t.lchild);
            this.preOrder(t.rchild);
        }
    }

左->根->右

	public void inOrder() {
        System.out.print("二叉树的中序遍历序列：");
        this.inOrder(root);
        System.out.println();
    }
    //中序遍历
    private void inOrder(BTNode t) {
        if (t != null) {
            this.inOrder(t.lchild);
            System.out.print(t.data);
            this.inOrder(t.rchild);
        }
    }

左->右->根

	public void postOrder() {
        System.out.print("二叉树的后序遍历序列：");
        this.postOrder(root);
        System.out.println();
    }
    //后序遍历
    private void postOrder(BTNode t) {
        if (t != null) {
            this.postOrder(t.lchild);
            this.postOrder(t.rchild);
            System.out.print(t.data);
        }
    }