4
Contributors
3
Replies
4
Views
8 Years
Discussion Span
Last Post by Nick Evan
0

THINK THIS IS THE ANSWER
Using Stack

Traverse_reverse_order( )
{
node *ptr, *stack;
create_empty_stack (stack);
ptr=head;
while (ptr! =(node*) NULL)
{
push (stack, ptr);
ptr=ptr->next;
}
while (! empty (stack))
{
ptr=pop (stack);
print ptr->info;
}
}

Using Recursion

Traverse_reverse_order (node *ptr)
{
if (ptr! =(node*) NULL)
Traverse_reverse_order (ptr->next)
Print ptr->info;
}
0

That is nice way to hide the fact that someone else is doing your homework . Innovative idea.

I agree.
First I thought the OP was just too lazy to even type the requirements here, but I see that you're right.
I always wonder why people are smart enough to constantly cheat the system and are willing to put a lot of time and effort in that, but they won't sit down for 10 minutes to try to make their own damn homework...

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.