#include using namespace std; //Credits to my professor who help me to understand the concept of linked list //LinkedList in C++ //This program enable you to create a list using linked list concept //add value in the beginning or prepend on the list //Add after a given position //Delete a node struct node{ int data; // DATA VALUE node *next; // POINTER TO THE NEXT NODE }*head; void createList(int); void addBeginning(int); void addAfter(int,int); void display(); void del(int); int main(){ while(true){ int choice; system("cls"); cout<<"```````````````````````````````````````\n"; cout<<"[1] Create a list\n"; cout<<"[2] Add to the Beginning or Prepend on the List\n"; cout<<"[3] Add after a given position\n"; cout<<"[4] Delete a node\n"; cout<<"[5] Display linked-list\n"; cout<<"[6] Exit\n\n"; cout<<"```````````````````````````````````````\n"; cout<<"Enter Choice : "; cin>>choice; int nodeSize, dataValue, position; switch(choice){ case 1: cout<<"How many nodes do you want to create? : "; cin>> nodeSize; for(int i = 0; i < nodeSize; i++ ){ cout<<"Enter node data : "; cin>>dataValue; createList(dataValue); } display(); break; case 2: cout<<"Enter the node data to be prepended : "; cin>>dataValue; addBeginning(dataValue); display(); break; case 3: cout<<"Enter the node data to be added : "; cin>>dataValue; cout<<"Enter the position to where the data will be inserted: "; cin>>position; addAfter(dataValue,position); display(); break; case 4: cout<<"Enter the node data to be deleted : "; cin>>dataValue; del(dataValue); display(); break; case 5: display(); break; case 6: goto exit; break; default: cout<<"Invalid Choice!\n"; system("pause > 0"); break; } } exit: system("cls"); } void createList(int n){ node *p, *tail; // p is the one who visits each elements of the list tail is the end of the list which contains the NULL sentinel value tail = new node; // initializing tail as a new node variable tail->data = n; // initializing the element value; tail->next = NULL; // create the next property as NULL since this is a tail. if(head == NULL){ // if head is = to null, the list is empty, so make the tail equal to the head head = tail; }else{ p = head; // Initialize p to the head to begin traversal. while(p->next != NULL){ // if next-node property is not null, go to the next element p = p->next; } p->next = tail; } } void addBeginning(int n){ node *tmp; tmp = new node; tmp->data = n; tmp->next = head; head = tmp; } void addAfter(int data, int pos){ node *tmp, *p; if(head == NULL){ cout<<"You have to create your linked list first!"; return; } p = head; // Initialize p to the head to begin traversal. for(int i = 0; i < pos-1; i++){ p = p->next; if(p==NULL){ cout<<"The position you specify exceeds the list size"; return; } } tmp = new node; tmp->data = data; tmp->next = p->next; p->next = tmp; } void display(){ node *p; if(head == NULL){ cout<<"Your list is empty!\n"; return; } p = head; cout<data<<"\t\t\t"<next<next; } cout< 0"); } void del(int num){ node *tmp, *p; if(head == NULL){ cout<<"Your list is empty!\n"; return; } //1.) Delete the value at the beginning of the node; if(head->data == num){ tmp = head; head = head->next; delete tmp; return; } p = head; while(p->next->next != NULL){ if(p->next->data == num){ tmp = p->next; p->next = tmp->next; delete tmp; return; } p = p->next; } if(p->next->data == num){ tmp = p->next; delete tmp; p->next = NULL; return; } }

LinkListed C++