1)
public Map<Integer, LinkedList<Integer>> roletaRussa(LinkedList<Integer> list){
    Map<Integer,LinkedList<Integer>> toReturn = new HashMap<>();
    LinkedList<Integer> values = fillList(list);
    int before = 0;
    while(!values.isEmpty()){
        Random generator = new Random();
        int nextToPlay = generator.nextInt(values.size()) +before % list.size();;
        int a = values.get(nextToPlay);
        values.remove(nextToPlay);
        toReturn.put(a,fillList(values));
        before = nextToPlay;
    }
    return toReturn;
}

private LinkedList<Integer> fillList (LinkedList<Integer> received){
    LinkedList<Integer> returnable = new LinkedList<>();
    for(Integer i : received){
        returnable.add(i);
    }
    return returnable;
}

2)
public int prof(E no, List<E> path){
    Node node = root;
    int prof = 0;
    boolean found = false;
    List<Node> path = new ArrayList<>();
    while(!found){
        if(node.getElement().equals(no)){
            path.add(no);
            found = true;
        }else{
            Node right = root.getLeft();
            Node left = root.getRight();
            if(no > node){
                prof += 2;
                path.add(right);
                node = right;
            }else{
                prof += 2;
                path.add(left);
                node = left;
            }
        }
    }
    return prof;
}

5)
public boolean areEquals(HeapPriorityQuere<K,V> h1, HeapPriorityQuere<K,V>h2){
    if (h1.size() != h2.size()){
        return false;
    }
    HeapPriorityQuere<K,V> toClone1 = h1.clone();
    HeapPriorityQuere<K,V> toClone2 = h2.clone();
    List<V> values = new ArrayList<>();
    //sameKey
    while(toClone1.isEmpty()){
        K k1 = toClone1.removeMin().getKey();
        K k2 = toClone2.removeMin().getKey();
        if(!k1.equals(k2)){
            return false;
        }
    }
    return true;
}