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.
Loading...
  1. Practice
  2. Data Structures
  3. Trees
  4. Tree: Huffman Decoding
  5. Discussions

Tree: Huffman Decoding

  • sahil_gog + 1 comment

    Python implementation of the same solution:

    def decodeHuff(root , s):
   #Enter Your Code Here
    temp=root
    string=[]
    for i in s:
        c=int(i)
        if c==1:
            temp=temp.right
        elif c==0:
            temp=temp.left
        if temp.right==None and temp.left==None:
            string.append(temp.data)
            temp=root
    b=''.join(string)
    print b
    • seshu_thota + 1 comment

      what does the "temp = root " does here in the end

      if temp.right==None and temp.left==None:
            string.append(temp.data)
            temp=root  <---this one
    b=''.join(string)
    print b
      • davebrophy + 1 comment

        Not my code but I did something similar.

        Root is stored and never changes, so you can go back there after you reach a leaf. The variable "temp" stores the current position as you traverse down towards a leaf.

        Once you reach a leaf, identified by the lack of left/right links, you retrieve the data and add it to your string. Then you need to reset your position to the root node, so you set temp=root.

        • timnosov + 1 comment

          temp here is obviously a poor variable name choice. The variable head should be left untouched and a new variable, forexample current_node or just node should be used to traverse the tree down. 

          def is_last(node):
    return not node.left and not node.right

def go_right(node):
    return node.right

def go_left(node):
    return node.left

# Enter your code here. Read input from STDIN. Print output to STDOUT
def decodeHuff(root , s):
    result = []
    node = root
    for char in s:
        if char == '1':
            node = go_right(node)
        elif char == '0':
            node = go_left(node)
        
        if is_last(node):
            result.append(node.data)
            node = root
            
    print ''.join(result)
          • uds5501 + 0 comments

            I don't see how exactly your solution is different. Additionaly, temp has a local scope and leaves the root un bothered in the original solution. I can't really see how your solution improved the former