SinglyLL_insertion.cpp

#include<iostream>
using namespace std;
struct Node{
	int data;
	Node*next;
};
Node*head=NULL;
//insert at the beginning
void insertAtBeginning(int value){
	Node * newNode = new Node;
	newNode->data=value;
	newNode->next=head;
	head = newNode;
}
//insert at the End
void insertAtEnd(int value){
	Node* newNode = new Node;
	newNode->data=value;
	newNode->next=NULL;
	if(head==NULL){
		head = newNode;
		return;
	}
	Node * temp = head;
	while (temp->next != NULL){
		temp = temp->next;
	}
	temp->next=newNode;
}
//insert at the Middle (after given value)
void insertAfterValue(int value, int after){
	Node * temp = head;
	while(temp!=NULL && temp->data != after){
		temp = temp->next;
	}
	if (temp == NULL){
		cout<<"Node with value "<<after<<" not found!\n";
		return;
	}
	Node * newNode = new Node;
	newNode->data=value;
	newNode->next=temp->next;
	temp->next = newNode;
}
void displayList(){
	Node * temp = head;
	cout<<"Linked List: ";
	while(temp != NULL){
		cout<<temp->data<<" ->";
		temp = temp->next;
	}
	cout<<"NULL"<<endl;
}
int main(){
	insertAtBeginning(10);
	insertAtBeginning(20);
	insertAtEnd(5);
	insertAfterValue(15,10);
	displayList();
	return 0;
}