construct a binary tree from inorder and preorder traversal calculator

1inorder = [Q, B, K, C, F, A, G, P, E, D, H, R]
2preorder = [G, B, Q, A, C, K, F, P, D, E, R, H]

1I N F O R M A T I O N 

1inorder = [3, 2, 6, 7, 5, 4, 9, 8, 10, 1, 11, 12, 13]
2preorder = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]

1S B DHXEJKTFG