假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。-In the following descr iption of the three tuple hypothesis ( F, C, L/R ) sequence input a two fork tree plurilateral ( wherein F represents the parent node ID, C said the child node ID, said L/R C F children left or right child ), and in the three input tuple sequence, C is based on the layer order. A node identifier is the type of character. F= C　 ^　 is the root node ID, if C is also a　 ^　, said the end of input. try to write algorithm, from the input of the three tuple sequence to establish a binary tree of two two binary list, and to the sequence in the sequence output.