Question

Use a linked list to implement the following skeleton of an unsorted list typedef int ItemType: struct NodeType ItemType item; NodeType "next; class List List(); // default constructor List( const List &x); I copy constructor: deep copy is required List & operator = (const List &x); // assignment operator: deep copy. 1s required bool IsThere(ItemType x); identify if x is in the list void Insert(ItemType x); insert an item x void delete(ItemType x); // delete all the items x from the list void print print out all the items in the list void printaddress(); // print out the memory addresses of all the list elements int Length); //return the length of the list -List); lI destructor: should deallocate the linked list

I want the full code for this part and Its needs to be done in C++

Answer 1

// C++ program to implements an unsorted linked list

#include <iostream>

using namespace std;

typedef int ItemType;

struct NodeType

{

               ItemType item;

               NodeType *next;

};

class List{

private:

               NodeType *head;

               int num_elements;

public:

               List();//default constructor

               List(const List &x); // copy constructor : deep copy required

               List& operator=(const List &x); //assignment operator : deep copy required

               bool isThere(ItemType x); //identify x is in the list

               void Insert(ItemType x); //insert an item x

               void deleteItem(ItemType x); //delete all the items x from the list

               void print(); //print out all the items in the list

               void printaddress(); // print out the memory addresses of all elements in the list

               int Length(); // returns the length of the list

               ~List() ;// destructor : should deallocate the linked list

};

List::List()

{

               head = nullptr;

               num_elements =0;

}

List::List(const List &x)

{

               head = nullptr;

               num_elements = 0;

               NodeType *curr = x.head;

               while(curr != nullptr)

               {

                              Insert(curr->item);

                              curr = curr->next;

               }

}

List& List::operator =(const List&x)

{

               if (this != &x) ///avoid self-copy

               {

                              NodeType *curr;

                              while(head != nullptr)

                              {

                                             curr = head;

                                             head = head->next;

                                             delete curr;

                              }

                              head = nullptr;

                              num_elements = 0;

                              curr = x.head;

                              while(curr != nullptr)

                              {

                                             Insert(curr->item);

                                             curr = curr->next;

                              }

               }

               return *this;

}

bool List::isThere(ItemType x)

{

               NodeType *curr = head;

               while(curr != nullptr)

               {

                              if(curr->item == x)

                                             return true;

                              curr = curr->next;

               }

               return false;

}

void List::Insert(ItemType x)

{

               NodeType *node = new NodeType;

               node->item = x;

               node->next = nullptr;

               if(head == nullptr)

               {

                              head = node;

               }else{

                              NodeType *curr = head;

                              while(curr->next != nullptr)

                                             curr = curr->next;

                              curr->next = node;

               }

               num_elements++;

}

void List::deleteItem(ItemType x)

{

               NodeType *curr;

               while(head != nullptr && head->item == x)

               {

                              curr = head;

                              head = head->next;

                              delete curr;

                              num_elements--;

               }

               if(head != nullptr)

               {

                              curr = head->next;

                              NodeType *preCurr = head;

                              while(curr != nullptr)

                              {

                                             if(curr->item == x)

                                             {

                                                            preCurr->next = curr->next;

                                                            curr = curr->next;

                                                            num_elements--;

                                             }else

                                             {

                                                            preCurr = curr;

                                                            curr = curr->next;

                                             }

                              }

               }

}

void List::print()

{

               if(head == nullptr)

                              cout<<" Empty list"<<endl;

               else{

                              cout<<" List : ";

                              NodeType *curr = head;

                              while(curr !=nullptr)

                              {

                                             cout<<curr->item<<" ";

                                             curr = curr->next;

                              }

                              cout<<endl;

               }

}

void List::printaddress()

{

               if(head == nullptr)

                              cout<<" Empty List"<<endl;

               else{

                              cout<<" List address : ";

                              NodeType *curr = head;

                              while(curr != nullptr)

                              {

                                             cout<<curr<<" ";

                                             curr = curr->next;

                              }

                              cout<<endl;

               }

}

int List::Length()

{

               return num_elements;

}

List::~List()

{

               NodeType *curr;

               while(head != nullptr)

               {

                              curr = head;

                              head = head->next;

                              delete curr;

               }

               num_elements =0;

}

int main() {

               // test the List class

               List l1,l2;

               for(ItemType i=0;i<5;i++)

                              l1.Insert(i);

               cout<<" L1 : "<<endl;

               l1.print();

               l2 = l1;

               cout<<" L2 : "<<endl;

               l2.print();

               cout<<" 4 is in L1 : "<<l1.isThere(4)<<endl;

               cout<<" 10 is in L1 : "<<l1.isThere(10)<<endl;

               List l3(l2);

               cout<<" L3 : "<<endl;

               l3.print();

               l3.Insert(2);

               l3.deleteItem(2);

               cout<<" L3 address : "<<endl;

               l3.printaddress();

               cout<<" L3 : "<<endl;

               l3.print();

               cout<<" Length of l1 : "<<l1.Length()<<endl;

               return 0;

}

//end of program

Output: