public static void main(String args[]){
        int inorder[] = {9,15,25,6,18,-1,3,-3};
        ContructTreeFromInOrderTraversalRootGreaterThanChild tf = new ContructTreeFromInOrderTraversalRootGreaterThanChild();
        Node root = tf.createTree(inorder);
        TreeTraversals tt = new TreeTraversals();
        tt.inOrder(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