im close to finish this problem set , but i cannot figure out the working recursive function, especially if backtracking may work in this form of implementation:
void rec_unload(node *trv)
{
for(int m =0 ; m<27 ; m++)
{
if(trv ->children[m] == NULL)
{
free(trv ->children[m]);
}
else
{
rec_unload(trv->children[m]) ;
}
}
}
I appreciate any effort to look into my issue.