Python 实现哈夫曼树和哈夫曼编码，Python面试项目经验

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 =