二叉树中序遍历

递归

publicvoid MidOrder(BinaryTree head){

        if(head==null){

            return;

        }

       MidOrder(head.left);

        System.out.println(head.value);

        preOrder(head.right);

}

非递归

classBinaryTree{

    BinaryTreeleft;

    BinaryTreeright;

    intvalue;

    publicBinaryTree(intvalue){

        this.value= value;

    }

}

publicclassSolution {

    publicvoid MidOrder(BinaryTree head){

        if(head==null){

            return;

        }

       MidOrder(head.left);

        System.out.println(head.value);

        preOrder(head.right);

    }

    publicstaticvoidmain(String[]args){

        BinaryTree root =newBinaryTree(22);

        BinaryTree left =newBinaryTree(33);

        BinaryTree right =newBinaryTree(44);

        root.left= left;

        root.right= right;

        newSolution().preOrder(root);

    }

}