-
Notifications
You must be signed in to change notification settings - Fork 0
/
single linked list using forward list.cpp
66 lines (54 loc) · 1.79 KB
/
single linked list using forward list.cpp
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
#include <iostream>
#include <forward_list>
using namespace std;
int main() {
// Create a forward_list of integers
forward_list<int> list;
// Insert elements at the front of the list
list.push_front(10);
list.push_front(20);
list.push_front(30);
// Traverse the list and print its elements
cout << "List after insertions: ";
for (auto it = list.begin(); it != list.end(); it++) {
cout << *it << " ";
}
cout << endl;
// Remove the first element of the list
list.pop_front();
// Traverse the list and print its elements
cout << "List after deletion: ";
for (auto it = list.begin(); it != list.end(); it++) {
cout << *it << " ";
}
cout << endl;
// Insert an element at a specific position in the list
auto it = list.begin();
it++; // move to the second element
list.insert_after(it, 40);
// Traverse the list and print its elements
cout << "List after insertion at a specific position: ";
for (auto it = list.begin(); it != list.end(); it++) {
cout << *it << " ";
}
cout << endl;
// Remove an element at a specific position in the list
auto it2 = list.begin();
it2++; // move to the second element
list.erase_after(it2);
// Traverse the list and print its elements
cout << "List after deletion at a specific position: ";
for (auto it = list.begin(); it != list.end(); it++) {
cout << *it << " ";
}
cout << endl;
// Find an element in the list
auto it3 = find(list.begin(), list.end(), 20);
if (it3 != list.end()) {
cout << "Element 20 found in the list" << endl;
}
else {
cout << "Element 20 not found in the list" << endl;
}
return 0;
}