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

  • gfigueroam
     + 0 comments

    Hi, I have somethig similar to your code, just without the verification if the left or right node exists because if it was coded on the string, the path should exists.

    	void decode(String s, Node root) {
        Node head = root;
        char[] chars = s.toCharArray();
        for(int i = 0; i < chars.length; i++){
            if(chars[i]=='0'){
                head = head.left;
            } else{
                head = head.right;
            }
            if(head.left == null && head.right == null){ 
                System.out.print(head.data);
                head=root;
            }
        }
         
    }