public Node createTree(int inorder[]){
        return createTree(inorder,0,inorder.length-1);
    }
http://www.geeksforgeeks.org/construct-binary-tree-from-inorder-traversal/
Given inorder traversal of binary tree where every node is greater than 
its left and right child.
Test cases:
One two or more nodes in the tree
src/com/interview/tree/ContructTreeFromInOrderTraversalRootGreaterThanChild.java