设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。

-Let binary tree node value of capital letters input binary tree preorder traversal and inorder traversal sequences, this binary tree is generated, the output of the post-order traversal of the binary tree hierarchy traversal sequence. Enter a node value in the binary tree to find the node, if the node exists, the output path from the root to the junction point, or give no information.