哈夫曼树（利用python实现）

程序

import numpy as np
import queue

image = np.array(
    [
        [3,1,2,4],
        [2,4,0,2],
        [2,2,3,3],
        [2,4,4,2],
    ]
)
hist=np.bincount(image.ravel(), minlength=5)
probabilities = hist/np.sum(hist)

def get2smallest(data):
    first=second =1;
    fid=sid =0
    for idx,element in enumerate(data):
        if(element