简单的二叉树遍历，先按先序输进二叉树元素。就可以得到递归先序，中序，后序遍历输出二叉树中的元素-Simple binary tree traversal, press first order input binary elements. You can get a recursive preorder, inorder, preorder output binary tree after the elements