C++ Linked List Exercises: Delete the n^th node of a Singly Linked List from end

C++ Linked List: Exercise-13 with Solution

Write a C++ program to delete the n^th node of a Singly Linked List from the end.

Test Data:
Original list:
7 5 3 1
Remove the 2nd node from the end of the said list:
Updated list:
7 5 1
Remove the 3rd node from the end of the said list:
Updated list:
5 1

Sample Solution:

C++ Code:

#include <iostream>

using namespace std;

struct  Node
{   
    int num;
    Node *next;
 }; //node constructed

  int size = 0;
  void insert(Node** head, int num){
    Node* new_Node = new Node();
    new_Node->num = num;
    new_Node->next = *head;
    *head = new_Node;    
     size++;
}

Node* delete_last_node(Node* head, int n) {
        Node *p = head, *q = head;
        while (n--) q = q->next;
        if (!q) return head->next;
        while (q->next) {
            p = p->next;
            q = q->next;
        }
        Node* toDelete = p->next;
        p->next = p->next->next;
        delete toDelete;
        return head;
}

  //Display all nodes
  void display_all_nodes(Node* node)
    { 
      while(node!=NULL){
        cout << node->num << " "; 
        node = node->next; 
    } 
}

int main()
{
    Node* head = NULL;
    insert(&head,1);
    insert(&head,3);
    insert(&head,5);
    insert(&head,7);
    cout << "Original list:\n";
    display_all_nodes(head); 
    int pos = 2;
    cout << "\n\nRemove the " << pos << "nd node from the end of the said list:";
    cout << "\nUpdated list:\n";
    head = delete_last_node(head, pos);
    display_all_nodes(head); 
    pos = 3;
    cout << "\n\nRemove the " << pos << "rd node from the end of the said list:";
    cout << "\nUpdated list:\n";
    head = delete_last_node(head, pos);
    display_all_nodes(head); 
    cout<<endl;
    return 0;
}

Sample Output:

Original list:
7 5 3 1

Remove the 2nd node from the end of the said list:
Updated list:
7 5 1

Remove the 3rd node from the end of the said list:
Updated list:
5 1

Flowchart:

CPP Code Editor:

Contribute your code and comments through Disqus.

Previous C++ Exercise: Delete the last node of a Singly Linked List.
Next C++ Exercise: K^th node from the Middle towards Head of a Linked List.