CareerCup

The below function works in a single traversal

struct node* reverse(struct node *temp){
	if(temp!=NULL && temp->next!=NULL){
		struct node *t=reverse(temp->next);
		temp->next->next=temp;
		temp->next=NULL;
		return t;
	}
	else
		return temp;
}

nice

Awesome..! short and effective by using recursion ...

There are three way to reverse LinkList:
1)Traverse list and store nodes in stack then pop up one by one.
2)Use two pointer one (p) at beginning and one (q) at last now start interchanging with p++ and q--.
3)recursion.

pos = list->head;
t = getfromtail(list);
while( t!= NULL ;)
{
if (pos = head )
{
// adding before head for the first time
t->next = head;
head = t;
pos = t;
next = pos->next;
}

else {
//Adding after pos
pos->next = t;
t->next = next;
pos = t;
}
t = getfromtail(list);

}

struct node* reverse(struct node *temp){ if(temp!=NULL && temp->next!=NULL){ struct node *t=reverse(temp->next); temp->next->next=temp; temp->next=NULL; return t; } else return temp;}