根据伪满二的前序序列，求ltag-rlink的二前序遍历比如：给出伪满二的前序序列如下：A' B' D G' / H C' E' F I /则可以求出ltag-rlink的二前序遍历为0A5 0B3 1D-1 1G4 1H-1 0C-1 0E8 1F-1 1I-1(注：各个结点按照“ltag结点名rlink”的方式给出，结点之间用一个空格分隔）现给出伪满二的前序序列如下：A' B' C' / I H D' E' G / F则所求出ltag-rlink的二前序遍历为According to the pre-order traversal sequence of a "pseudo full binary tree", please write down the pre-order traversal sequence of this binary tree in an "ltag-rlink" form.For example: Given the pre-order traversal sequence of a "pseudo full binary tree" like this: A' B' D G' / H C' E' F I /Then we can get the pre-order traversal sequence of this binary tree in the "ltag-rlink" form: 0A5 0B3 1D-1 1G4 1H-1 0C-1 0E8 1F-1 1I-1(P.S. The form of each node should be "LtagNodeRlink", and all the nodes are separated by a single space.)Now, given the pre-order traversal sequence of a "pseudo full binary tree" like "A' B' C' / I H D' E' G / F", please write down the pre-order traversal sequence of this binary tree in the "ltag-rlink" form.