C++ Linked List Exercises: Delete first node of a Singly Linked List

C++ Linked List: Exercise-10 with Solution

Write a C++ program to delete first node of a given Singly Linked List.

Test Data:
Original Linked list:
13 11 9 7 5 3 1
Delete first node of Singly Linked List:
11 9 7 5 3 1

Sample Solution:

C++ Code:

#include <iostream>


using namespace std; 
//Declare node 
struct Node{
    int num;
    Node *next;
};
 
//Starting (Head) node
struct Node *head=NULL;
 
//Insert node at start
void insert_Node(int n){
    struct Node *new_node=new Node;
    new_node->num=n;
    new_node->next=head;
    head=new_node;
}

//Delete first node of the list
    void delete_first_node() 
	{
      if(head != NULL) {
        Node* temp = head;
        head = head->next; 
        free(temp); 
      }
    }

//Display all nodes
void display_all_nodes()
  {
	struct Node *temp = head;
    while(temp!=NULL){
        cout<<temp->num<<" ";
        temp=temp->next;
    }
    }
 
int main(){
    insert_Node(1);
    insert_Node(3);
    insert_Node(5);
    insert_Node(7);
    insert_Node(9);
    insert_Node(11);
    insert_Node(13);
    cout<<"Original Linked list:\n";
	display_all_nodes();
	cout<<"\n\nDelete first node of  Singly Linked List:\n";
    delete_first_node();
    display_all_nodes();
    cout<<endl;
    return 0;
}

Sample Output:

Original Linked list:
13 11 9 7 5 3 1 

Delete first node of  Singly Linked List:
11 9 7 5 3 1 

Flowchart:

CPP Code Editor:

Contribute your code and comments through Disqus.

Previous C++ Exercise: Insert a node at any position of a Singly Linked List.
Next C++ Exercise: Delete a middle node from a Singly Linked List.