private Object[] getLeaf() {

    if (jPointer >= data.length) {
      data[++iPointer] = new Object[data.length];
      jPointer = 0;
    }
    return data[iPointer];
  }
returns available leaf to insert data.
if current leaf is already full,creates new leaf and returns it
src/ds/HashedArrayTree.java