C++ - Linked List Implementation using C++ Program.


IncludeHelp 27 August 2016

In this code snippet we will learn how to implement Linked List using C++ program.

In this example we will implement a singly linked list with insert, delete and display operations. Here we will declare Linked List Node, Insert Node at the beginning, Delete Node from beginning and display all linked list Nodes.



C++ Code Snippet - Linked List Implementation using C++ Program

#include <iostream>

using namespace std;

//Declare Node 
struct Node{
	int num;
	Node *next;
};

//Declare starting (Head) node
struct Node *head=NULL;

//Insert node at start
void insertNode(int n){
	struct Node *newNode=new Node;
	newNode->num=n;
	newNode->next=head;
	head=newNode;
}

//Traverse/ display all nodes (print items)
void display(){
	if(head==NULL){
		cout<<"List is empty!"<<endl;
		return;
	}
	struct Node *temp=head;
	while(temp!=NULL){
		cout<<temp->num<<" ";
		temp=temp->next;
	}
	cout<<endl;
}

//delete node from start
void deleteItem(){
	if(head==NULL){
		cout<<"List is empty!"<<endl;
		return;
	}
	cout<<head->num<<" is removed."<<endl;
	head=head->next;
}
int main(){
	
	display();
	insertNode(10);
	insertNode(20);
	insertNode(30);
	insertNode(40);
	insertNode(50);
	display();
	deleteItem(); deleteItem(); deleteItem(); deleteItem(); deleteItem();
	deleteItem();
	display();
	return 0;
}
    List is empty!
    50 40 30 20 10
    50 is removed.
    40 is removed.
    30 is removed.
    20 is removed.
    10 is removed.
    List is empty!
    List is empty!