import heapqclass Node:    def __init__(self, char, freq):        self.char = char        self.freq = freq        self.left = None        self.right = None    def __lt__(self, other):        return self.freq < other.freqdef build_huffman_tree(freq_list):    heap = [Node(i, freq) for i, freq in en...