Question

1. ) Given the following unorderedLinkedList class, provide an implementation for the member function reverse. When the reverse function is called on an unorderedLinkedList object called mylist (e.g. mylist.reverse()), it will create a new unorderedLinkedList and insert the elements of mylist into the new list in reverse order and then return the new list.

struct nodeType

{

               int info;

               nodeType *link;

};

class unorderedLinkedList

{

protected:

               nodeType *first; //pointer to the first node of the list

public:

              

               unorderedLinkedList();

                             

               //Function to insert newItem at the beginning of the list.

               //Postcondition: first points to the new list, newItem is inserted at the beginning of the list,

               last points to the last node, and count is incremented by 1.

               void insertFirst(const int& newItem);

               //Function to insert newItem at the end of the list.

               //Postcondition: first points to the new list, newItem is inserted at the end of the list,

//last points to the last node, and count is incremented by 1.

               void insertLast(const int& newItem);

               unorderedLinkedList* reverse()

               {

                  //provide implementation of this function

               }

};

Answer 1

unorderedLinkedList* reverse(){

nodeType *nodePtr;

nodeType *next;

nodeType *result=NULL;

if ( !first )

{

cout << "\n\tThe list is empty.";

return NULL;

}

nodePtr = first;

while (nodePtr!=NULL)

{

next=nodePtr->link;

nodePtr->link=result;

result=nodePtr;

nodePtr=next;

}

unorderedLinkedList *test = new unorderedLinkedList();

test->first = result;

return test;

}




Thanks, PLEASE COMMENT if there is any concern. I have written down reverse() method.

PLEASE COMMENT for any doubts/concern. I will make the changes accordingly.