Question

THE ATTACHED PICTURES ARE THE ALGORITHMS of link list IN C PLEASE write the programs of these pictures in C++
while writing the programs make sure that your programs are correct and please do them separately and while doing them comment the EACH STEP I AM posting my question third time please do them PROPERLY and do them separately and comment EACH STEP

Deleting Last Node 1) P- head 2) while P.link<>NIL Q- P P-P.link 3) Q.link= NIL 4) Dispose(P) 5) Exit

Please do it properly label EACH STEP in EACH program of C++ please do not do it in C it is a humble request please do it properly  
this is the assignment please do it properly make sure that your answer is correct please do all steps and comment EACH STEP please it is a humble request

Answer 1

Last node deleting c++ code:

// CPP program to remove last node of
// linked list.
#include <iostream>
using namespace std;
  
/* Link list node */
struct Node {
int data;
struct Node* next;
};
  
/* Function to remove the last node   
of the linked list */
Node* removeLastNode(struct Node* head)
{
if (head == NULL)
return NULL;
  
if (head->next == NULL)
{
delete head;
return NULL;
}
  
// Find the second last node
Node* second_last = head;
while (second_last->next->next != NULL)
second_last = second_last->next;
  
// Delete last node
delete (second_last->next);
  
// Change next of second last
second_last->next = NULL;
  
return head;
}
  
// Function to push node at head
void push(struct Node** head_ref, int new_data)
{
struct Node* new_node = new Node;
new_node->data = new_data;
new_node->next = (*head_ref);
(*head_ref) = new_node;
}
  
// Driver code
int main()
{
/* Start with the empty list */
Node* head = NULL;
  
/* Use push() function to construct
the below list 8 -> 23 -> 11 -> 29 -> 12 */
push(&head, 12);
push(&head, 29);
push(&head, 11);
push(&head, 23);
push(&head, 8);
  
head = removeLastNode(head);
for (Node* temp = head; temp != NULL; temp = temp->next)
cout << temp->data << " ";
  
return 0;
}

2. Deletion of intermediate node in c++

// C++ program to delete middle of a linked list
#include<bits/stdc++.h>
using namespace std;
  
/* Link list Node */
struct Node
{
int data;
struct Node* next;
};
  
// Deletes middle node and returns head of the
// modified list
struct Node* deleteMid(struct Node *head)
{
// Base cases
if (head == NULL)
return NULL;
if (head->next == NULL)
{
delete head;
return NULL;
}
  
// Initialize slow and fast pointers to reach
// middle of linked list
struct Node *slow_ptr = head;
struct Node *fast_ptr = head;
  
// Find the middle and previous of middle.
struct Node *prev; // To store previous of slow_ptr
while (fast_ptr != NULL && fast_ptr->next != NULL)
{
fast_ptr = fast_ptr->next->next;
prev = slow_ptr;
slow_ptr = slow_ptr->next;
}
  
//Delete the middle node
prev->next = slow_ptr->next;
delete slow_ptr;
  
return head;
}
  
// A utility function to print a given linked list
void printList(struct Node *ptr)
{
while (ptr != NULL)
{
cout << ptr->data << "->";
ptr = ptr->next;
}
cout << "NULL\n";
}
  
// Utility function to create a new node.
Node *newNode(int data)
{
struct Node *temp = new Node;
temp->data = data;
temp->next = NULL;
return temp;
}
  
/* Drier program to test above function*/
int main()
{
/* Start with the empty list */
struct Node* head = newNode(1);
head->next = newNode(2);
head->next->next = newNode(3);
head->next->next->next = newNode(4);
  
cout << "Gven Linked List\n";
printList(head);
  
head = deleteMid(head);
  
cout << "Linked List after deletion of middle\n";
printList(head);
  
return 0;
}

I had written these answer by self please thumbs up, and if you have any other query please feel free to ask in comment.