-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path21st_linkedlist.cpp
More file actions
60 lines (56 loc) · 1.08 KB
/
21st_linkedlist.cpp
File metadata and controls
60 lines (56 loc) · 1.08 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
//implement linked list in C++
#include<bits/stdc++.h>
using namespace std;
//in C++ we can have constructors for structure
// https://www.geeksforgeeks.org/difference-c-structures-c-structures/
struct node
{
int data;
node *next;
node(int a)//constructor for structure
{
data=a;
next=nullptr;
}
};
/* In C we had to write
struct node head;
if we wanted to create a variable of struct node type
BUT
in c++ we can directly write node head
*/
node *append(node *head)
{
int data;
cout<<"Enter data : ";
cin>>data;
//now we will create a temporary node
node *temp=new node(data);
if(head==nullptr)
{
head=temp;
}
else
{
node *p=head;
while(p->next!=nullptr)
p=p->next;
p->next=temp;
}
return head;
}
int main()
{
int n;
cout<<"Enter number of nodes : ";
cin>>n;
node *head=nullptr;
for(int i=1;i<=n;i++)
head=append(head);
node *p=head;
while(p!=nullptr)
{
cout<<p->data<<" --> ";
p=p->next;
}
}