Question

C++ ONLY PLEASE. CAN I GET SOME HELP WRITING THIS HEADER FILE? I MAINLY WANT TO KNOW HOW I WOULD WRITE IT WITH A TEMPLATE. PLEASE AND THANKS IN ADVANCE.

**************LinkedList.h requirements************************

linked list Class

EXTRA CREDIT OPPORTUNITY:

Create the LinkedList class as a template class for 5 extra credit points!!!

private memebers

• Create a structure called ListNode, which should hold a Dinosaur and a pointer to the next ListNode
• ListNode pointer called head – will eventually point to the first node in the linked list
• ListNode pointer called tail – will eventually point to the last node in the linked list
• Integer called numNodes – will hold the number of nodes in the linked list

public members

• Constructor – initialize head, tail, & numNodes
• Destructor – delete all nodes in the list
• getLength accessor
• getNodeValue accessor – should return a Dinosaur
• appendNode – appends a node containing the value passed into nodeValue, to the end of the list
• insertNode – this function is passed a node value (Dinosaur) and a position where the node should be inserted. The first node is position 0.
• deleteNode – finds the node with the argument position & deletes it

#####################SAMPLE OUTPUT######################

There is no sample output this is only a header file. this is going to belng to a much bigger assignement and i have the header mostly written but i would like the extra 5 points for doing it with a template please. Thanks again in advance :)

Answer 1

Here is the solution to above problem . PLEASE READ CODE COMMENTS FOR MORE INFORMATION

C++ CODE

#include <iostream>
using namespace std;

//dinosaur object
class Dinosaur
{
public:
int value;
Dinosaur()
{
  
}
Dinosaur(int value)
{
this->value=value;
}
};

//list node class
template<class T>
class ListNode
{
public:
T data;
ListNode<T> * next;
ListNode()
{
  
}
};

//linked list car
template<class T>
class LinkedList
{
private:
ListNode<T> * head;
ListNode<T> * tail;
int numNodes;
public:
//initializing
LinkedList()
{
head=NULL;
tail=NULL;
numNodes=0;
}
//deleting all nodes
~LinkedList()
{
ListNode<T>* ptr=head;
ListNode<T> * temp;
while(ptr!=NULL)
{
temp=ptr;
ptr=ptr->next;
delete(temp);
}
}
//getting length
int getLength()
{
return numNodes;
}
//appending a node
void appendNode(T data)
{
numNodes=numNodes+1;
if(head==NULL)
{
head = new ListNode<T>();
head->data=data;
head->next=NULL;
return;
}
ListNode<T> * temp= new ListNode<T>();
temp->data=data;
temp->next=NULL;
ListNode <T> *ptr=head;
while(ptr->next!=NULL)
{
ptr=ptr->next;
}
ptr->next=temp;

}
//get node value
T getNodeValue(int position)
{
int count=0;
ListNode <T> *ptr=head;
while(ptr->next!=NULL&&count!=position)
{
ptr=ptr->next;
count++;
}
return ptr->data;
}

//insert node at a location
void insertNode(T data,int position)
{
ListNode<T> * temp= new ListNode<T>();
temp->data=data;
int count=0;
temp->next=NULL;
ListNode <T> *ptr=head;
ListNode<T> * prev=head;
while(ptr->next!=NULL&&count!=position)
{
prev=ptr;
ptr=ptr->next;
count++;
}
prev->next=temp;
temp->next=ptr;
numNodes=numNodes+1;
}

//delete a node at a location
void deleteNode(int position)
{
ListNode <T> *cur=head;
int count=0;
ListNode <T> * prev= head;
while(cur->next!=NULL&&count!=position)
{
prev=cur;
cur=cur->next;
count++;
}
ListNode<T> * temp=cur;
prev->next=cur->next;
delete(temp);
numNodes=numNodes-1;

}

//printing the linked list
void print()
{
ListNode <T> *cur=head;
  
while(cur!=NULL)
{
cout<<cur->data.value<<" "; //displaying object
cur=cur->next;
}
cout<<endl;
}
};
int main() {
  
LinkedList<Dinosaur> L;
Dinosaur a(1);
Dinosaur b(2);
Dinosaur c(3);
Dinosaur d(4);
Dinosaur e(4);
  
L.appendNode(a);
L.appendNode(b);
L.appendNode(c);
L.appendNode(d);
cout<<"Printing the list: ";
L.print();
cout<<"LENGTH OF LIST:"<<L.getLength()<<endl;
// cout<"Printing the length: "<<L.getLength()<<endl;
cout<<"get Second element : "<<L.getNodeValue(1).value<<endl;
cout<<"INSERT 4 AT 3rd LOCATION: ";
L.insertNode(e,2);
L.print();
cout<<"Append Node 4 at end: ";
L.appendNode(e);
L.print();
cout<<"Remove the 4th element: \n";
L.deleteNode(3);
L.print();
cout<<"LENGTH OF LIST:"<<L.getLength();
return 0;
}

SCREENSHOT OF OUTPUT

Output: Printing the list: 1 2 3 4 LENGTH OF LIST:4 get Second element : 2 INSERT 4 AT 3rd LOCATION: 1 2 4 3 4 Append Node 4 at end: 1 2 4 3 4 4 Remove the 4th element: 1 2 4 4 4 LENGTH OF LIST:5