Question

in C++ function that reverses a linked list of integers and reverses the order of its nodes. The function will have one call-by-reference parameter that is a pointer to the head of the list. After the function is called, this pointer will point to the head of a linked list that has the same nodes as the original list but in the reverse of the order they had in original list. Note that your function will neither create nor destroy any nodes. It will simply rearrange nodes. Place your function is suitable test program

Answer 1

Since you have not provided your existing actual code, I am providing the code as per my understanding.

CODE

#include <iostream>

using namespace std;

struct Node {

  int data;

  struct Node* next;

  Node(int data)

  {

    this->data = data;

    next = NULL;

  }

};

struct LinkedList {

  Node* head;

  LinkedList()

  {

    head = NULL;

  }

  Node* reverseLinkedList(Node* head) {

if (head == NULL || head->next == NULL)

return head;

Node* rest = reverseLinkedList(head->next);

head->next->next = head;

head->next = NULL;

return rest;

}

  void display(struct Node *head)

  {

    struct Node* temp = head;

    while (temp != NULL) {

      cout << temp->data << " ";

      temp = temp->next;

    }

  }

  void insert(int data)

  {

    Node* temp = new Node(data);

    temp->next = head;

    head = temp;

  }

};

int main()

{

  LinkedList ll;

  ll.insert(100);

  ll.insert(12);

  ll.insert(33);

  ll.insert(8);

  ll.display(ll.head);

  ll.head = ll.reverseLinkedList(ll.head);

  cout << "\nReversed Linked list is: \n";

  ll.display(ll.head);

  return 0;

}