How can I implement Huffman decoding in Python?

How can I implement Huffman decoding in Python?

To implement Huffman decoding in Python, you'll need to create a tree structure based on the frequency of characters. Do you have a specific input in mind?

Yes, I have a string of characters and their corresponding frequencies.

Great! You can start by building a priority queue to create the Huffman tree. Would you like a code example?

Yes, please provide a code example for building the tree.

Here's a simple implementation:

import heapq

class 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.freq

def build_huffman_tree(frequencies):
    heap = [Node(char, freq) for char, freq in frequencies.items()]
    heapq.heapify(heap)

    while len(heap) > 1:
        left = heapq.heappop(heap)
        right = heapq.heappop(heap)
        merged = Node(None, left.freq + right.freq)
        merged.left = left
        merged.right = right
        heapq.heappush(heap, merged)

    return heap[0]

This code builds the Huffman tree from character frequencies.