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

  • wubrafiqcse807
     + 0 comments

    Simple Java Solutions :

    void decode(String s, Node root) {
        String str = "";
        Node head = root;
        for(int i = 0;i<s.length();i++) {
            if(s.charAt(i)=='0') {
                head = head.left;
            }
            if(s.charAt(i)=='1') {
                head = head.right;
            }
             str+=head.data;
            if(head.left==null && head.right==null) {

                head = root;
        }
    }
    System.out.println(str.replace("\0", ""));  
}