You are viewing a single comment's thread. Return to all comments →
void decode_huff(node * root,string s) { node*ptr=root; int i=0; char c; while(idata=='\0'){ c=s.at(i++); //cout<left; else ptr=ptr->right; } cout<data; ptr=root; } }
Tree: Huffman Decoding
You are viewing a single comment's thread. Return to all comments →
void decode_huff(node * root,string s) { node*ptr=root; int i=0; char c; while(idata=='\0'){ c=s.at(i++); //cout<left; else ptr=ptr->right; } cout<data; ptr=root; } }