建立一棵二叉树，并对其进行遍历（先序、中序、后序），打印输出遍历结果。-Create a binary tree, and traverse the results of its traversal (preorder, inorder, postorder), print output.

利用构造完全二叉树的方法建立二叉树结构，并实现二叉树的先序、中序、后序遍历以及求深度操作。 例如：依次输入字符ABCDE#F##G####H-Constructed using methods established complete binary tree binary tree structure, and to achieve binary tree preorder, inorder, preorder, and the depth of the operation. For