-
Notifications
You must be signed in to change notification settings - Fork 464
/
add-a-node-in-linked-list.cpp
57 lines (52 loc) · 1.21 KB
/
add-a-node-in-linked-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
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node* next;
Node(int x){
data = x;
next = NULL;
}
};
class Solution{
public:
//Function to insert a node at the beginning of the linked list.
Node *insertAtBegining(Node *head, int x) {
Node *temp=new Node(x);
temp->next=head;
return temp;
}
//Function to insert a node at the end of the linked list.
Node *insertAtEnd(Node *head, int x) {
if(head==NULL){return new Node(x);}
Node *temp=head;
while(temp->next!=NULL){
temp=temp->next;
}
Node *y=new Node(x);
temp->next=y;
return head;
}
};
int main()
{
int n;
cin>>n;
struct Node *head = NULL;
for (int i = 0; i < n; ++i)
{
int data, indicator;
cin>>data;
cin>>indicator;
Solution obj;
if(indicator)
head = obj.insertAtEnd(head, data);
else
head = obj.insertAtBegining(head, data);
}
while (head != NULL) { //Print the list
cout << head->data <<" ";
head = head->next;
}
}