-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedList.cpp
More file actions
154 lines (143 loc) · 2.89 KB
/
LinkedList.cpp
File metadata and controls
154 lines (143 loc) · 2.89 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
#include<iostream>
using namespace std;
struct Node
{
int value;
Node *nextNode;
};
Node *firstNode, *tempNode, *newNode, *prevNode;
int size;
void printLinkedList()
{
tempNode= firstNode;
for(int i=0; i<size; i++)
{
cout<<tempNode->value<<" ----> ";
tempNode = tempNode->nextNode;
}
cout<<endl;
}
void searchNode(int item)
{
int flag =0;
tempNode = firstNode;
while(tempNode!=NULL)
{
if(tempNode->value==item)
{
flag =1;
break;
}
else
{
tempNode = tempNode->nextNode;
}
}
if(flag == 1)
{
cout<<"Found"<<endl;
}
else
{
cout<<"Not Found"<<endl;
}
}
void insertNode(int prevValue, int item)
{
newNode = new (Node);
newNode->value = item;
newNode->nextNode = NULL;
tempNode = firstNode;
while(tempNode->value != prevValue)
{
tempNode = tempNode->nextNode;
}
newNode->nextNode = tempNode->nextNode;
tempNode->nextNode=newNode;
}
void deleteNode(int nodevalue)
{
int firstNodeDeleteFlag =0;
tempNode = firstNode;
prevNode = firstNode;
while(tempNode->value != nodevalue)
{
firstNodeDeleteFlag =1;
prevNode = tempNode;
tempNode = prevNode->nextNode;
}
prevNode->nextNode = tempNode->nextNode;
if(firstNodeDeleteFlag==0)
{
firstNode = firstNode->nextNode;
}
delete(tempNode);
}
int main()
{
//create a linked list
int data, choice=0, item, prevValue;
cout<<"Enter number of Nodes: ";
cin>>size;
firstNode = NULL;
for(int i=0; i<size; i++)
{
cout<<"Enter the Value of Node no "<<i+1<<" : ";
cin>>data;
newNode = new (Node);
newNode->value = data;
newNode->nextNode = NULL;
if(firstNode==NULL)
{
firstNode=newNode;
tempNode=newNode;
}
else
{
tempNode->nextNode = newNode;
tempNode = newNode;
}
}
//create done-----------------------
while(choice !=5)
{
cout<<"------------------------------------"<<endl;
cout<<"Enter 1 to print the Linked List"<<endl;
cout<<"Enter 2 to search a node from the Linked List"<<endl;
cout<<"Enter 3 to insert a new node in the Linked List"<<endl;
cout<<"Enter 4 to delete a node from the Linked List"<<endl;
cout<<"Enter 5 to exit"<<endl;
cout<<"------------------------------------"<<endl;
cout<<"What do you want? : ";
cin>>choice;
cout<<"------------------------------------"<<endl;
switch(choice)
{
case 1:
printLinkedList();
break;
case 2:
cout<<"Enter the value to search: ";
cin>>item;
searchNode(item);
break;
case 3:
cout<<"insert the value of new node: ";
cin>>item;
cout<<"Insert the value of previous node: ";
cin>>prevValue;
insertNode(prevValue, item);
size++;
break;
case 4:
cout<<"insert the value to delete a node: ";
cin>>item;
deleteNode(item);
size--;
break;
case 5:
cout<<"Good Bye !!!!"<<endl;
break;
}
}
}