PROGRAMMING:Constructing binary tree with postorder and middle order sequences

Constructing binary tree with postorder and middle order sequences
###Input example:
In the first line, the length of the input sequence is n, in the second line, n characters are input to represent the sequence traversed by the binary tree, and in the third line, n characters are input to represent the sequence traversed by the binary tree
```in
nine
GHDBEIFCA
GDHBAECIF
```
###Output example:
Output binary tree traversal sequence.
```out
ABDGHCEFI
```







answer：If there is no answer, please comment