Question

c++ please

Given the following skeleton of an unsorted list class that uses an unsorted linked list:

template<class ItemType>

struct NodeType

{

                ItemType item;

                NodeType* next;

};

template<class ItemType>

class UList

{

public:

                UList(); // default constrctor

                UList(const UList &x); // we implement copy constructor with deep copy

                UList& operator = (UList &x); // equal sign operator with deep copy

                bool IsThere(ItemType item) const; // return true of false to indicate if item is in the

                                                    // list

                void Insert(ItemType item); // if item is not in the list, insert it into the list

                void Delete(ItemType item); // delete item from the list

                void Print(); // Print all the items in the list on screen

                int Length();   // return the number of items in the list

                ~UList(); // we do not implement destructor: programmer should be responsible to deallocate the linked list

private:

                NodeType<ItemType> * listPtr;

};

Task 1: Implement the template class UList on the basis of the above skeleton. Compile your program.

Task 2: Write a simple driver that reads values from file float.dat, inserts them into an instance, x, of the list, prints the length of the final list, and prints the values of all the list elements.

Task 3: Add code to your driver to test the remaining member functions. Delete 2.0, 9.0, and 6.2 from x and print the list to be sure they are gone.

Task 4: Create another instance, y, through the copy constructor such that the content of y is the same as that of x, but a deep copy should be done. Print out the all the list elements of y.

Task 5: Declare an instance, z, and assign the content of x to z through the operation “=”. Print out the all the list elements of z.

Task 6: Test if 9.0 is in the lists x and y via the member function: IsThere(ItemType item) and print out the test results.

Task 7: What is the Big-O notation for the time complexity of IsThere( ) function?

Answer 1

Ans :

/C++ program

#include<iostream>
using namespace std;
template<class ItemType>

struct NodeType

{

ItemType item;

NodeType* next;

};

template<class ItemType>
class UList

{

public:

UList(){
listPtr = NULL;
}

UList(const UList &x){
NodeType<ItemType> * head = x.listPtr;
while(head){
this->Insert(head->item);
head = head->next;
}
}

bool IsThere(ItemType item) const{
NodeType<ItemType> * head = listPtr;
while(head){
if(head->item == item)return true;
head = head->next;
}
return false;

}
void Insert(ItemType item){
  
NodeType<ItemType> *head = listPtr;
NodeType<ItemType> *newNode = new NodeType<ItemType>;
newNode->item = item;
newNode->next = NULL;
if(listPtr==NULL){
listPtr = newNode;
return;
}
while(head->next){
if(head->item == item)return;
head = head->next;
}  
head->next = newNode;

}
void Delete(ItemType item){
NodeType<ItemType>* temp = listPtr, *prev;
if (temp != NULL && temp->item==item)
{
listPtr = temp->next;
delete(temp);
return;
}
while (temp != NULL && temp->item != item)
{
prev = temp;
temp = temp->next;
}

if (temp == NULL) return;
prev->next = temp->next;
  
delete(temp);

}

void Print(){
NodeType<ItemType> *head = listPtr;
while(head){
cout<<head->item<<" ";
head = head->next;
}
cout<<"\n\n";
}

int Length(){
NodeType<ItemType> *head = listPtr;
int count = 0;
while(head){
count++;
head = head->next;
}
return count;
}

~UList(){
NodeType<ItemType> *head = listPtr,*next;
  
while(head){
next = head->next;
delete(head);
head = next;
}
listPtr = NULL;
}

private:

NodeType<ItemType> * listPtr;

};

int main(){
UList<float>list;
list.Insert(5.0);
list.Insert(6.0);
list.Insert(5.0);
list.Insert(7.0);
list.Insert(2.0);
  
list.Print();
  
list.Delete(6.0);
  
list.Print();
  
return 0;
  
}

Thank you..