Hi, I'm new here and looking to learn more on algos and participate in
discussions.
@juver++, Recursion solution to the 1st problem implicitly using
stack. No?
print (list l)
{
if(i->next) print(l->next);
print l;
}
On Jan 6, 4:55 pm, juver++ <avpostni...@gmail.com> wrote:
> 1. Recursive function. Print node's element after processing next link of
> the current node. Also this can be achieved using stack.
> 2. Please clarify the question.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
