说明：  二叉树的先序，中序，后序，按层遍历算法。以中序输入，用‘#’代替叶子节点的子节点输入。
(binary tree first sequence, sequence after sequence, layer by traversal algorithm. The order to import, use '#' instead of the leaf nodes for input nodes.)