Construct Binary Tree from Preorder and Inorder Traversal

My Java solution to LeetCode problem #105:

Given preorder and inorder traversal of a tree, construct the binary tree. You may assume that duplicates do not exist in the tree.