void decode_huff(node * root,string s) { node * ptr; int n;

ptr = root;
for(n=0;s[n];n++)
{
    ptr = (s[n] == '0') ? ptr->left : ptr->right;
    if(ptr->data)
    {
        cout << ptr->data;
        ptr = root;
    }
}

}