Python code:

def decodeHuff(root, s):

#Enter Your Code Here

n = len(s)

i = 0

node = root

while i < n:

    if s[i] == "0":

        node = node.left

        if node.left == None and node.right == None:

            print(node.data, end = "")

            node = root

    else:

        node = node.right

        if node.left == None and node.right == None:
            print(node.data, end = "")
            node = root

    i = i + 1