private NoeudArbre recherchePrioriteList(double priorite) {
        NoeudArbre result = NIL;
        int i = 0;
        while (result == NIL && i < listNoeudArbres.size()) {
            if (listNoeudArbres.get(i).priorite == priorite) {
                result = listNoeudArbres.get(i);
            }
            i++;
        }
        return result;
    }