private Node createTree(int inorder[],int low,int high)
    {
        if(low > high){
            return null;
        }
        int i;
        int maxIndex = low;
        for(i=low ; i <= high; i++){
            if(inorder[maxIndex] > inorder[i]){
                maxIndex = i;
            }
        }
        Node root = Node.newNode(inorder[maxIndex]);
        root.left = createTree(inorder,low,maxIndex-1);
        root.right = createTree(inorder,maxIndex+1,high);
        return root;
    }
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