huffman树_Python 实现哈夫曼树和哈夫曼编码

技术博客： https://github.com/yongxinz/tech-blog

同时，也欢迎关注我的微信公众号 AlwaysBeta，更多精彩内容等你来。

关于哈夫曼树的定义、构建以及哈夫曼编码，可以参考《大话数据结构》这本书，也可以看这篇博客(https://www.cnblogs.com/kubixuesheng/p/4397798.html)，写的也很清楚。

下面主要来看一下哈夫曼树的 Python 实现：

#!/usr/bin/env python# -*- coding: utf-8 -*-# 统计字符出现频率，生成映射表def count_frequency(text):    chars = []    ret = []        for char in text:        if char in chars:            continue        else:            chars.append(char)            ret.append((char, text.count(char)))        return ret# 节点类class Node:    def __init__(self, frequency):        self.left = None        self.right = None        self.father = None        self.frequency = frequency    def is_left(self):        return self.father.left == self# 创建叶子节点def create_nodes(frequency_list):    return [Node(frequency) for frequency in frequency_list]# 创建Huffman树def create_huffman_tree(nodes):    queue = nodes[:]    while len(queue) > 1:        queue.sort(key=lambda item: item.frequency)        node_left = queue.pop(0)        node_right = queue.pop(0)        node_father = Node(node_left.frequency + node_right.frequency)        node_father.left = node_left        node_father.right = node_right        node_left.father = node_father        node_right.father = node_father        queue.append(node_father)    queue[0].father = None    return queue[0]# Huffman编码def huffman_encoding(nodes, root):    huffman_code = [''] * len(nodes)        for i in range(len(nodes)):        node = nodes[i]        while node != root:            if node.is_left():                huffman_code[i] = '0' + huffman_code[i]            else:                huffman_code[i] = '1' + huffman_code[i]            node = node.father                return huffman_code# 编码整个字符串def encode_str(text, char_frequency, codes):    ret = ''    for char in text:        i = 0        for item in char_frequency:            if char == item[0]:                ret += codes[i]            i += 1    return ret# 解码整个字符串def decode_str(huffman_str, char_frequency, codes):    ret = ''    while huffman_str != '':        i = 0        for item in codes:            if item in huffman_str and huffman_str.index(item) == 0:                ret += char_frequency[i][0]                huffman_str = huffman_str[len(item):]            i += 1    return retif __name__ == '__main__':    text = raw_input('The text to encode:')    char_frequency = count_frequency(text)    nodes = create_nodes([item[1] for item in char_frequency])    root = create_huffman_tree(nodes)    codes = huffman_encoding(nodes, root)    huffman_str = encode_str(text, char_frequency, codes)    origin_str = decode_str(huffman_str, char_frequency, codes)    print 'Encode result:' + huffman_str    print 'Decode result:' + origin_str

参考文档：

https://www.cnblogs.com/tomhawk/p/7471133.html

https://gist.github.com/Jackeriss/268074dbd383a9eabb7fac1d50ed98e5

https://arianx.me/2018/06/24/Python-Huffman-Tree/