// C programme to reverse a linked list
strcut Node {
int data ;
struct Node* next ;
} ;
typedef struct Node* Node ;
//function to reverse a linked list
Node reverseLinkedList (Node head)
{
Node ptr = NULL ;
Node newHead = NULL ;
while ( head != NULL )
{
//save head
ptr = head;
//advance head
head = head->next;
//advance the value at newHead
newHead->next = newHead ;
//add the saved node at newHead of list
newhead = ptr ;
}
}
strcut Node {
int data ;
struct Node* next ;
} ;
typedef struct Node* Node ;
//function to reverse a linked list
Node reverseLinkedList (Node head)
{
Node ptr = NULL ;
Node newHead = NULL ;
while ( head != NULL )
{
//save head
ptr = head;
//advance head
head = head->next;
//advance the value at newHead
newHead->next = newHead ;
//add the saved node at newHead of list
newhead = ptr ;
}
}
No comments:
Post a Comment