在Python中遍历霍夫曼树返回原始文本

class Node:
    def __init__(self, char=None, freq=None, left=None, right=None):
        self.char = char
        self.freq = freq
        self.left = left
        self.right = right

def traverse_huffman_tree(root, encoded_text):
    current_node = root
    decoded_text = ""

    for bit in encoded_text:
        if bit == '0':
            current_node = current_node.left
        else:
            current_node = current_node.right

        if current_node.char is not None:
            decoded_text += current_node.char
            current_node = root

    return decoded_text

# 示例用法
encoded_text = "101010110011010110100101010"
root = Node(freq=0)
root.left = Node(char='a', freq=2)
root.right = Node(freq=0)
root.right.left = Node(char='b', freq=3)
root.right.right = Node(char='c', freq=4)

decoded_text = traverse_huffman_tree(root, encoded_text)
print(decoded_text)  # 输出: "abccba"