Construct Tree from given Inorder and Preorder traversals
Using dependency that splitting list by first not used preorder sign such as:
preOrder = ['A', 'B', 'D', 'E', 'C', 'F']
inOrder = ['D', 'B', 'E', 'A', 'F', 'C']
preOrder first sign = A
split inOrder list by A:
A
DBE FC
Code uses that dependency by recursion such as every time first element of preOrder list is removed.