Construct Binary Search Tree(BST) from Preorder code example

Example: Construct Binary tree from its given Postorder and Inorder traversal online

inorder = [ D,F,E,B,G,L,J,K,H,C,A]
postorder = [D,B,F,E,A,G,C,L,J,H,K]