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.
defdecodeHuff(root,s):#Enter Your Code Heres=list(s)current=rootresults=[]deftraverse(current,s):iflen(s)>0:ifs[0]=="0"andcurrent.leftisnotNone:s.pop(0)traverse(current.left,s)elifs[0]=="1"andcurrent.rightisnotNone:s.pop(0)traverse(current.right,s)ifcurrent.leftisNoneandcurrent.rightisNone:results.append(current.data)whilelen(s)>0:traverse(current,s)print("".join(results))
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Huffman Decoding
You are viewing a single comment's thread. Return to all comments →