Create Construct Binary Tree from Inorder and Postorder Traversal.java

Need to use start and end position to keep track of the inorder traversal array. Need another pointer p to keep track of the postorder traversal from right to left