I have been tasked to write a code for a Singly Linked list that includes the following: Implement a singly linked list class with the following methods: - `void insertAtBeginning(int value)`: Inserts a new node with the given value at the beginning of the list. - `void insertAtEnd(int value)`: Inserts a new node with the given value at the end of the list. - `void deleteNode(int value)`: Deletes the first occurrence of a node with the given value. - `void display()`: Displays the elements of the linked list. I have everything EXCEPT for the deleteNode. I have it included, but it is throwing an error....I just need a little extra help to fix that part. My Code: # #include using namespace std; class Node { //user defined type. public: // public class modifier to access the class node. int value; Node* next; }; void display(Node *head) { if(head == NULL){ cout << "NULL" << endl; } else { cout << head->value << endl; display(head->next); } } void insertAtBeginning(Node**head, int newValue){ // Steps to add a Node to the beginning of the linked list //1. Prepare a newNode Node * newNode = new Node(); newNode ->value = newValue; //2. Put it in front of the current head newNode->next = *head; //3. Move head of the list to point to the newNode *head= newNode; } void insertAtEnd(Node**head, int newValue) { //1.Prepare a newNode Node* newNode= new Node(); newNode ->value = newValue; newNode->next = NULL; //2. If Linked list is empty, newNode will be a head node if(*head ==NULL){ *head = newNode; return; } //3. Find last node Node* last= *head; while(last->next!=NULL){ last=last->next; } //4. Insert newNode after last node (at the end of List) last->next =newNode; } void deleteNode(Node**before_del){ Node* temp; temp = before_del->next; before_del->next = temp->next; delete temp; } int main() { Node* head=new Node(); Node* second=new Node(); Node* third=new Node(); Node* fourth=new Node(); head->value = 7; head->next = second; second->value = 12; second->next = third; third->value = 15; third->next = fourth; fourth->value = 20; fourth->next = NULL; insertAtBeginning(&head, 4); insertAtBeginning(&head, 6); insertAtEnd(&head, 23); del(&head(15)->next); display(head); }.

1. I have been tasked to write a code for a Singly Linked list that includes the following: Implement
a singly linked list class with the following methods: - `void insertAtBeginning(int value)`:
Inserts a new node with the given value at the beginning of the list. - `void insertAtEnd(int
value)`: Inserts a new node with the given value at the end of the list. - `void deleteNode(int
value)`: Deletes the first occurrence of a node with the given value. - `void display()`: Displays
the elements of the linked list. I have everything EXCEPT for the deleteNode. I have it included,
but it is throwing an error....I just need a little extra help to fix that part. My Code: #
#include
using namespace std;
class Node { //user defined type.
public: // public class modifier to access the class node.
int value;
Node* next;
};
void display(Node *head) {
if(head == NULL){
cout << "NULL" << endl;
}
else {
cout << head->value << endl;
display(head->next);
}
}
void insertAtBeginning(Node**head, int newValue){
// Steps to add a Node to the beginning of the linked list
//1. Prepare a newNode
Node * newNode = new Node();
newNode ->value = newValue;
//2. Put it in front of the current head
newNode->next = *head;
//3. Move head of the list to point to the newNode
*head= newNode;
}
void insertAtEnd(Node**head, int newValue) {

2. //1.Prepare a newNode
Node* newNode= new Node();
newNode ->value = newValue;
newNode->next = NULL;
//2. If Linked list is empty, newNode will be a head node
if(*head ==NULL){
*head = newNode;
return;
}
//3. Find last node
Node* last= *head;
while(last->next!=NULL){
last=last->next;
}
//4. Insert newNode after last node (at the end of List)
last->next =newNode;
}
void deleteNode(Node**before_del){
Node* temp;
temp = before_del->next;
before_del->next = temp->next;
delete temp;
}
int main()
{
Node* head=new Node();
Node* second=new Node();
Node* third=new Node();
Node* fourth=new Node();
head->value = 7;
head->next = second;
second->value = 12;
second->next = third;
third->value = 15;
third->next = fourth;

3. fourth->value = 20;
fourth->next = NULL;
insertAtBeginning(&head, 4);
insertAtBeginning(&head, 6);
insertAtEnd(&head, 23);
del(&head(15)->next);
display(head);
}