public int getSubHeap(int idx, V[] vet){
    HeapPriorityQuere<K,V> toClone = this.clone();
    List<K> values = new ArrayList<>();
    while(!toClone.isEmpty()){
        values.add(toClone.removemin().getKey());
    }
    //put in order
    K first = values.remove(0);
    values.add(first);
    values = Lists.reverse(values);
    List<K> toAdd = new ArrayList<>();
    if(values.get(idx) != null){
        // recursive;
        recursive (toAdd,values,idx);
    }
    for(int i = 0; i< toAdd.size(); i++){
        vet[i] = toAdd.get(i);
    }
    return toAdd.size();
}

private void recursive(List<K> toAdd,List<K> values, int idx){
    toAdd.add(values.get(idx))
    if(values.get(2*(idx+1)-1) != null){
        recurisve(toAdd,values,2*(idx+1)-1);
        if(values.get(2*(idx+1) != null){
            recurisve(toAdd,values,2*(idx+1));
        }
    }
}