设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。
(Binary tree node is set in capital letters, enter the pre-order traversal of a binary tree traversal sequence and generates this binary tree, the binary output after preorder traversal sequence and hierarchical. Enter a point value knot, look for the node in the binary tree, if the node exists, then the output　the root to the node' s path, or there is no information given.)