Construct Tree From Preorder and Inorder

Given the preorder and inorder traversals of a binary tree with unique values, rebuild the tree and print it in level-order using null for gaps (omit trailing nulls).

1 <= n <= 3000 All values are unique