设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。-Based binary tree node value of capital letters, enter the first order binary tree traversal and traversal sequences in the sequence to generate this tree, the output of the binary tree traversal post-traversal sequences and at different levels. Enter the value of a node in the tree in search of the nodes, if the node exists, then the output from the root to the node path, otherwise the information given does not exist.