Q. Reverse a linked list without modifying the existing list.
Anonimo
struct node { void* data; node* next; }; node* reverseList(node* list) { if(list==NULL) { return NULL; } else { node* p = list; node* newNode = new node(); newNode->data = p->data; newNode->next = NULL; node* head = newNode; while(p->next!=NULL) { p = p->next; node* newNode = new node(); newNode->data = p->data; newNode->next = head; head = newNode; } return head; } }