Repository navigation
Expand file tree
/
Copy pathsingly_linked_list.cpp
More file actions
152 lines (136 loc) · 3.23 KB
/
Copy pathsingly_linked_list.cpp
File metadata and controls
152 lines (136 loc) · 3.23 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
#include <iostream>
#include <conio.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
struct node
{
int value;
struct node *next;
};
void insert();
void display();
void delete_node();
int count();
typedef struct node DATA_NODE;
DATA_NODE *head_node, *first_node, *temp_node = 0, *prev_node, next_node;
int data;
int main()
{
int option = 0;
cout << "singly linked list c++ example - All operations\n";
while (option < 5)
{
cout << "\noptions\n";
cout << "1 : insert into linked list \n";
cout << "2 : delete from linked list \n";
cout << "3 : display linked list\n";
cout << "4 : count linked list\n";
cout << "others : Exit()\n";
cout << "Enter your option : ";
scanf("%d", &option);
switch (option)
{
case 1:
insert();
break;
case 2:
delete_node();
break;
case 3:
display();
break;
case 4:
count();
break;
default:
break;
}
}
return 0;
}
void insert()
{
cout << "\n Enter element for insert linked list : \n ";
scanf("%d", &data);
temp_node = (DATA_NODE *)malloc(sizeof(DATA_NODE));
temp_node->value = data;
if (first_node == 0)
{
first_node = temp_node;
}
else
{
head_node->next = temp_node;
}
temp_node->next = 0;
head_node = temp_node;
fflush(stdin);
}
void delete_node()
{
int countvalue, pos, i = 0;
countvalue = count();
temp_node = first_node;
cout << "\n Enter position for delete element : \n";
scanf("%d", &pos);
if (pos > 0 && pos <= countvalue)
{
if (pos == 1)
{
temp_node = temp_node->next;
first_node = temp_node;
cout << "\n deleted successfully \n\n ";
}
else
{
while (temp_node != 0)
{
if (i == (pos - 1))
{
prev_node->next = temp_node->next;
if (i == (countvalue - 1))
{
head_node = prev_node;
}
cout << "\n delete successfully \n\n";
break;
}
else
{
i++;
prev_node = temp_node;
temp_node = temp_node->next;
}
}
}
}
else
cout << "\n invalid position \n\n";
}
void display()
{
int count = 0;
temp_node = first_node;
cout << "\ndispiay linked list : \n";
while (temp_node != 0)
{
cout << "# " << temp_node->value;
count++;
temp_node = temp_node->next;
}
cout << "\n no of items in linked list : %d \n"
<< count;
}
int count()
{
int count = 0;
temp_node = first_node;
while (temp_node != 0)
{
count++;
temp_node = temp_node->next;
}
cout << "\n no of item in linked list : %d" << count;
return count;
}