From 7935cc7969cf13ba1f13437b46842869168c4953 Mon Sep 17 00:00:00 2001
From: RazenMurmu <102614464+RazenMurmu@users.noreply.github.com>
Date: Sun, 16 Oct 2022 14:11:45 +0530
Subject: [PATCH] Create LinkedListByRazen.C

---
 LinkedListByRazen.C | 154 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 154 insertions(+)
 create mode 100644 LinkedListByRazen.C

diff --git a/LinkedListByRazen.C b/LinkedListByRazen.C
new file mode 100644
index 0000000..8bb7cf8
--- /dev/null
+++ b/LinkedListByRazen.C
@@ -0,0 +1,154 @@
+#include<stdio.h>
+#include<conio.h>
+#include<stdlib.h>
+struct node
+{int data;
+ struct node *next;
+}*p,*tmp,*tmp1;
+void insert_end(int);
+void insert_beg(int);
+void ldelete(int);
+void display();
+void main()
+{ 
+  int val,n;
+  p=NULL;
+  do
+	{
+	 printf("\n1.INSERT AT END");
+	 printf("\n2.INSERT AT BEG");
+	 printf("\n3.DELETE A PARTICULAR ELE");
+	 printf("\n4.DELETE FROM BEG");
+	 printf("\n5.DELETE FROM END");
+	 printf("\n6.DISPLAY");
+	 printf("\n7.EXIT");
+	 printf("\nenter ur choice : ");
+	 scanf("%d",&n);
+	 switch(n)
+		{case 1: printf("\nenter the value ");
+			 scanf("%d",&val);
+			 insert_end(val);
+			 break;
+		 case 2: printf("\nenter the value");
+			 scanf("%d",&val);
+			 insert_beg(val);
+			 break;
+		 case 3: printf("\nenter the value");
+			 scanf("%d",&val);
+			 l_delete(val);
+			 break;
+		 case 4: 
+			 delete_beg();
+			 break;
+		 case 5: 
+			 delete_end();
+			 break;
+		 case 6: display();
+		 		 break;
+		 case 7: exit(0);
+		 		 break;
+		 default: printf("\n Wrong Choice!");
+		 		  break;
+		}
+	 printf("\n do u want to cont... ");
+	}while('y'==getch());
+
+ }
+
+ void insert_end(int ele)
+ {
+	  tmp=p;
+	  tmp1=(struct node*)malloc(sizeof(struct node));
+	  tmp1->data=ele;
+	  tmp1->next=NULL;
+	  if(p==NULL)
+		p=tmp1;
+	  else
+		{
+			while(tmp->next!=NULL)
+				tmp=tmp->next;
+		 	tmp->next=tmp1;
+		 }
+ }
+
+void insert_beg(int ele)
+{
+	 tmp=p;
+	 tmp1=(struct node*)malloc(sizeof(struct node));
+	 tmp1->data=ele;
+	 tmp1->next=p;
+	 p=tmp1;
+}
+
+void l_delete(int ele)
+{
+     tmp=p;
+	 struct node *pre=tmp;
+	 while(tmp!=NULL)
+		{if(tmp->data==ele)
+		    { if(tmp==p)
+		       {p=tmp->next;
+			free(tmp);
+			return;
+			}
+		      else
+			{pre->next=tmp->next;
+			 free(tmp);
+			 return;
+			 }
+		    }
+		 else
+		    { pre=tmp;
+		      tmp=tmp->next;
+		    }
+		}
+	  printf("\n no match found!! ");
+ }
+ 
+void delete_beg()
+{	
+	tmp=p;
+	if(p==NULL)
+		printf("\n no element to be deleted!! ");
+	else
+	{
+		printf("\nelement deleted - %d", p->data);
+		p=p->next;
+	}
+
+ }
+ 
+void delete_end()
+{	
+	tmp=p;
+	struct node* pre;
+	if(p==NULL)
+		printf("\n no element to be deleted!! ");
+	else if(p->next==NULL)
+	{
+		printf("\nelement deleted - %d", p->data);
+		p=NULL;
+
+	}
+		
+	else
+	{
+		while(tmp->next!=NULL){
+			pre=tmp;
+			tmp=tmp->next;
+		}
+		pre->next=NULL;
+		printf("\nelement deleted - %d", tmp->data);
+		
+	}
+
+ }
+
+void display()
+{
+	tmp=p;
+ 	while(tmp!=NULL)
+		{printf("\n %d",tmp->data);
+	 	tmp=tmp->next;
+		}
+}