We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Huffman Decoding
  5. Discussions

Tree: Huffman Decoding

  • remi_denoyer
     + 0 comments

    There is a bug, NULL (None) is represented by chr(0)

    def decodeHuff(root, s):
    i = 0
    node = root
    res = ""
    while i < len(s):
        while node.data == chr(0):
            if s[i] == '0':
                assert node.left
                node = node.left
            else:
                assert node.right
                node = node.right
            i += 1
        res += node.data
        node = root
    print(res)