gistfile1.txt

from heapq import heappush, heapify, heappop

#Question1


def table_frequences(texte):
    table={}
    for i in texte:
        if i in table:
            table[i]=table[i]+1
        else:
            table[i]=1
    return table

#question2

def arbre_huff(occurrences):
    #construction d'un tas
    tas=[(occ, lettre) for (lettre, occ) in occurrences.items()]
    heapify(tas) #trier le tas

    while len(tas)>=2:
        occ1, noeud1 = heappop(tas) #noeud de + petit poids occ1
        occ2, noeud2 = heappop(tas) #noeud de 2ème + petit poids
        heappush(tas, (occ1+occ2,{0: noeud1, 1: noeud2}))  #ajoute au tas le noeud de poids occ1+occ2
    return heappop(tas)[1]