public boolean search(BTreeNode root, int data){
        int i =0;
        while(i < root.n && root.keys[i] < data){
            i++;
        }
        if(i < root.n && root.keys[i] == data){
            return true;
        }
        if(root.isLeaf){
            return false;
        }
        return search(root.child[i],data);
    }
http://www.geeksforgeeks.org/b-tree-set-1-insert-2/
http://www.geeksforgeeks.org/b-tree-set-1-introduction-2/
src/com/interview/tree/BTree.java