-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedListQueue.cpp
More file actions
99 lines (91 loc) · 2.22 KB
/
LinkedListQueue.cpp
File metadata and controls
99 lines (91 loc) · 2.22 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
#include<iostream>
using namespace std;
class Node
{
//-------------------------------------------Creation of Node-------------------------------------------
public :
int data;
Node *next;
};
class Linkedlist
{
public :
Node *start, *ptr;
Linkedlist()
{
start = NULL;
}
void insertFront(int n)
{
//-------------------------------------------Insertion in Front-------------------------------------------
Node *newnode = new Node();
newnode->data = n;
newnode->next = NULL;
if(start == NULL)
{
start = newnode;
}
else
{
newnode->next = start;
start = newnode;
}
}
void printList()
{
//-------------------------------------------Printing Nodes-------------------------------------------
cout<<"The nodes in the list are : ";
ptr = start;
while(ptr!=NULL)
{
cout<<ptr->data<<'\t';
ptr = ptr->next;
}
cout<<endl;
}
void deleteList()
{
bool flag = true;
Node *ptr;
while(flag)
{
ptr = start;
if(ptr->next == NULL)
{
if(ptr->data %2 ==0)
{
start = new Node();
}
break;
}
while(ptr->next->next!=NULL)
{
ptr = ptr->next;
}
if(ptr->next->data % 2 ==0)
{
ptr->next = NULL;
}
else
{
flag = false;
}
}
}
};
int main()
{
int num;
cout<<"Enter the number of elements to be entered : ";
cin>>num;
int i, n;
Linkedlist list;
cout<<"Enter the elements : ";
for(i=0;i<num;i++)
{
cin>>n;
list.insertFront(n);
}
list.deleteList();
list.printList();
}