delete item from linked list in c++

Comment

0

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 6/10 Helpfulness 3/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

delete item in singly linked list in cpp

Comment

2

Tip Talha shahid 1 GREPCC

#include<iostream>
#include<stdlib.h>
using namespace std;
class node{
    public:
    int data;
    node* next;
     void setData();
    void printData();
    void Deletion();
};

node* head =0;
void node::setData()
{
	int choice=1;
	head=new node();
    cout <<"Enter data : ";
    cin>>head->data;
    head->next=NULL;
    node* temp;
    temp=head;
    node* newnode;
     cout<<"Do you want to link another list if yes press 1 else press 2 : ";
    cin>>choice;
    while(choice==1)
    {
    newnode=new node();
    cout <<"\nEnter data : ";
	cin>>newnode->data;
    newnode->next=0;
    temp->next=newnode;
    temp=temp->next;
    cout<<"\nDo you want to link another list if yes press 1 else press 2 : ";
    cin>>choice;
    }
}

void node::Deletion()
{
	node* temp, *p;
	temp=head;
	p = NULL;
	int num;
	cout<<"Enter a number to which you are wanting to delete : ";
	cin>>num;
	while(temp!=0 && temp->data != num)
	{
		p = temp;
		temp = temp->next;	
	}
	if(temp != NULL){
		p->next = temp->next;
		delete temp;
	}
}


void node::printData()
{
	cout<<"\n\nPrinting Linked List........\n\n";
    node* temp;
    temp=head;
    while(temp!=0)
    {
        cout<<temp->data<<" ";
        temp=temp->next;
    }
}
int main(){

    node obj;
    obj.setData();
    obj.printData();
    obj.Deletion();
    obj.printData();
}

xxxxxxxxxx

#include<iostream>

#include<stdlib.h>

using namespace std;

class node{

    public:

    int data;

    node* next;

     void setData();

    void printData();

    void Deletion();

};

node* head =0;

void node::setData()

    int choice=1;

    head=new node();

    cout <<"Enter data : ";

    cin>>head->data;

    head->next=NULL;

    node* temp;

    temp=head;

    node* newnode;

     cout<<"Do you want to link another list if yes press 1 else press 2 : ";

    cin>>choice;

    while(choice==1)

    newnode=new node();

    cout <<"\nEnter data : ";

    cin>>newnode->data;

    newnode->next=0;

    temp->next=newnode;

    temp=temp->next;

    cout<<"\nDo you want to link another list if yes press 1 else press 2 : ";

    cin>>choice;

void node::Deletion()

    node* temp, *p;

    temp=head;

    p = NULL;

    int num;

    cout<<"Enter a number to which you are wanting to delete : ";

    cin>>num;

    while(temp!=0 && temp->data != num)

        p = temp;

        temp = temp->next;

    if(temp != NULL){

        p->next = temp->next;

        delete temp;

void node::printData()

    cout<<"\n\nPrinting Linked List........\n\n";

    node* temp;

    temp=head;

    while(temp!=0)

        cout<<temp->data<<" ";

        temp=temp->next;

int main(){

    node obj;

    obj.setData();

    obj.printData();

    obj.Deletion();

    obj.printData();

Popularity 9/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: c++

Share

Link to this answer
Share Copy Link

Contributed on Sep 13 2022

talha shahid

0 Answers Avg Quality 2/10

delete item from linked list in c++

Comment

1

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 9/10 Helpfulness 4/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

deletion in doubly linked list in cpp

Comment

0

Tip Talha shahid 1 GREPCC

#include<iostream>
using namespace std;
class node{
	public:
		int data;
		node* prev;
		node* next;
		void insertData();
		void printData();
		void deletion();
};
node* head=0;
void node::insertData()
{
	int c=1;
	head=new node();
	cout<<"Enter Data : ";
	cin>>head->data;
	head->next=0;
	head->prev=0;
	node* temp;
	temp=head;
	cout<<"Do you want to link another list if yes press 1 else press 2 : ";
	cin>>c;
	node *newnode;
	while(c==1)
	{
		newnode=new node();
		cout<<"Enter Data : ";
		cin>>newnode->data;
		newnode->next=0;
		newnode->prev=0;
		temp->next=newnode;
		temp=temp->next;
		cout<<"Do you want to link another list if yes press 1 else press 2 : ";
		cin>>c;
	}
}

void node::deletion()
{
	node* temp;
	temp=head;
	node *p;
	int num;
	cout<<"\nEnter number to which you are wanting to delete : ";
	cin>>num;
	while(temp!=0 && temp->data!=num)
	{
		p=temp;
		temp=temp->next;
	}
	if(temp!=0)
	{
		p->next=temp->next;
		delete(temp);
	}
}

void node::printData()
{
	node* temp;
	temp=head;
	while(temp!=0)
	{
		cout<<temp->data<<" ";
		temp=temp->next;
	}
}
int main()
{
	node obj;
	obj.insertData();
	obj.printData();
	obj.deletion();
	obj.printData();
	
}

xxxxxxxxxx

#include<iostream>

using namespace std;

class node{

    public:

        int data;

        node* prev;

        node* next;

        void insertData();

        void printData();

        void deletion();

};

node* head=0;

void node::insertData()

    int c=1;

    head=new node();

    cout<<"Enter Data : ";

    cin>>head->data;

    head->next=0;

    head->prev=0;

    node* temp;

    temp=head;

    cout<<"Do you want to link another list if yes press 1 else press 2 : ";

    cin>>c;

    node *newnode;

    while(c==1)

        newnode=new node();

        cout<<"Enter Data : ";

        cin>>newnode->data;

        newnode->next=0;

        newnode->prev=0;

        temp->next=newnode;

        temp=temp->next;

        cout<<"Do you want to link another list if yes press 1 else press 2 : ";

        cin>>c;

void node::deletion()

    node* temp;

    temp=head;

    node *p;

    int num;

    cout<<"\nEnter number to which you are wanting to delete : ";

    cin>>num;

    while(temp!=0 && temp->data!=num)

        p=temp;

        temp=temp->next;

    if(temp!=0)

        p->next=temp->next;

        delete(temp);

void node::printData()

    node* temp;

    temp=head;

    while(temp!=0)

        cout<<temp->data<<" ";

        temp=temp->next;

int main()

    node obj;

    obj.insertData();

    obj.printData();

    obj.deletion();

    obj.printData();

Popularity 6/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Sep 13 2022

talha shahid

0 Answers Avg Quality 2/10

delete item from linked list in c++

Comment

0

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 6/10 Helpfulness 3/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

delete item from linked list in c++

Comment

0

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 6/10 Helpfulness 3/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

delete item from linked list in c++

Comment

0

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 6/10 Helpfulness 3/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

delete item from linked list in c++

Comment

0

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 6/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

delete item from linked list in c++

Comment

0

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 6/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

delete item from linked list in c++

Comment

0

Tip Modern Manatee 1 GREPCC

// A complete working C++ program to
// demonstrate deletion in singly
// linked list with class
#include <bits/stdc++.h>
using namespace std;
 
// A linked list node
class Node{
public:
    int data;
    Node* next;
};
 
// Given a reference (pointer to pointer)
// to the head of a list and an int,
// inserts a new node on the front of the
// list.
void push(Node** head_ref, int new_data)
{
    Node* new_node = new Node();
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}
 
// Given a reference (pointer to pointer)
// to the head of a list and a key, deletes
// the first occurrence of key in linked list
void deleteNode(Node** head_ref, int key)
{
     
    // Store head node
    Node* temp = *head_ref;
    Node* prev = NULL;
     
    // If head node itself holds
    // the key to be deleted
    if (temp != NULL && temp->data == key)
    {
        *head_ref = temp->next; // Changed head
        delete temp;            // free old head
        return;
    }
 
    // Else Search for the key to be deleted,
    // keep track of the previous node as we
    // need to change 'prev->next' */
      else
    {
    while (temp != NULL && temp->data != key)
    {
        prev = temp;
        temp = temp->next;
    }
 
    // If key was not present in linked list
    if (temp == NULL)
        return;
 
    // Unlink the node from linked list
    prev->next = temp->next;
 
    // Free memory
    delete temp;
    }
}
 
// This function prints contents of
// linked list starting from the
// given node
void printList(Node* node)
{
    while (node != NULL)
    {
        cout << node->data << " ";
        node = node->next;
    }
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    Node* head = NULL;
 
    // Add elements in linked list
    push(&head, 7);
    push(&head, 1);
    push(&head, 3);
    push(&head, 2);
 
    puts("Created Linked List: ");
    printList(head);
 
    deleteNode(&head, 1);
    puts("\nLinked List after Deletion of 1: ");
     
    printList(head);
     
    return 0;
}
 
// This code is contributed by ac121102

xxxxxxxxxx

// A complete working C++ program to

// demonstrate deletion in singly

// linked list with class

#include <bits/stdc++.h>

using namespace std;

// A linked list node

class Node{

public:

    int data;

    Node* next;

};

// Given a reference (pointer to pointer)

// to the head of a list and an int,

// inserts a new node on the front of the

// list.

void push(Node** head_ref, int new_data)

    Node* new_node = new Node();

    new_node->data = new_data;

    new_node->next = (*head_ref);

    (*head_ref) = new_node;

// Given a reference (pointer to pointer)

// to the head of a list and a key, deletes

// the first occurrence of key in linked list

void deleteNode(Node** head_ref, int key)

    // Store head node

    Node* temp = *head_ref;

    Node* prev = NULL;

    // If head node itself holds

    // the key to be deleted

    if (temp != NULL && temp->data == key)

        *head_ref = temp->next; // Changed head

        delete temp;            // free old head

        return;

    // Else Search for the key to be deleted,

    // keep track of the previous node as we

    // need to change 'prev->next' */

      else

    while (temp != NULL && temp->data != key)

        prev = temp;

        temp = temp->next;

    // If key was not present in linked list

    if (temp == NULL)

        return;

    // Unlink the node from linked list

    prev->next = temp->next;

    // Free memory

    delete temp;

// This function prints contents of

// linked list starting from the

// given node

void printList(Node* node)

    while (node != NULL)

        cout << node->data << " ";

        node = node->next;

// Driver code

int main()

    // Start with the empty list

    Node* head = NULL;

    // Add elements in linked list

    push(&head, 7);

    push(&head, 1);

    push(&head, 3);

    push(&head, 2);

    puts("Created Linked List: ");

    printList(head);

    deleteNode(&head, 1);

    puts("\nLinked List after Deletion of 1: ");

    printList(head);

    return 0;

// This code is contributed by ac121102

Popularity 6/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Share

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Modern Manatee

0 Answers Avg Quality 2/10

delete item from linked list in c++

Contents

More Related Answers

delete item from linked list in c++

Closely Related Answers

delete item in singly linked list in cpp

delete item from linked list in c++

deletion in doubly linked list in cpp

delete item from linked list in c++

delete item from linked list in c++

delete item from linked list in c++

delete item from linked list in c++

delete item from linked list in c++

delete item from linked list in c++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.