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. Tree: Huffman Decoding
  2. Discussions

Tree: Huffman Decoding

Sort by

recency

|

19 Discussions

|

  • fencullen
     + 0 comments

    C++

    void decode_huff(node * root, string s) 
{
    string result = "";
    node * currNode = root;
    auto it = s.begin();
    
    while (it != s.end())
    {
        // Read s and traverse until we reach a leaf.
        while (currNode->data == '\0')
        {
            if (*it == '0')
            {
                currNode = currNode->left;
            }
            else if (*it == '1')
            {
                currNode = currNode->right;
            }
            else 
            {
                cout << "Error";
            }
            
            it++;
        }
        
        // Leaf. Get letter and reset.
        result += currNode->data;
        currNode = root;
    }
    
    cout << result;
}

  • yashdeora98294
     + 0 comments

    Here is Hackerrank Tree huffman decoding problem solution in Python Java c++ c and javascript

  • phptop
     + 0 comments

    There is something wrong with the problem as my solution just return the same input and it will work javascript 

    function processData(input) {
    //Enter your code here
    console.log(input);
}

  • phptop
     + 0 comments

    There is something wrong with the problem as my solution just return the same input and it will work javascript function processData(input) { //Enter your code here console.log(input); }

  • hjiron
     + 0 comments

    JAVA

    void decode(String s, Node root) {        
    Node current = root;
    for (char c : s.toCharArray()) {           
        if (c == '0') {
            current = current.left;
        } else {
            current = current.right;
        }
        
        if (current != null && current.data != '\0') {
            System.out.print(current.data);
            current = root;
        }
        
    }
}