-
Notifications
You must be signed in to change notification settings - Fork 0
/
tut100.c++
87 lines (76 loc) · 1.61 KB
/
tut100.c++
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
/*Reverse a linked list -> Given pointer to the head node of a linked list, the task is to reverse the linked list. We need to reverse the list by changing the links between nodes.
Examples:
Input: Head of following linked list
1->2->3->4->NULL
Output: Linked list should be changed to,
4->3->2->1->NULL
Input: Head of following linked list
1->2->3->4->5->NULL
Output: Linked list should be changed to,
5->4->3->2->1->NULL
Input: NULL
Output: NULL
*/
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node *next;
Node(int data)
{
this->data = data;
this->next = NULL;
}
};
struct LinkedList
{
Node *head;
LinkedList()
{
head = NULL;
}
void reverseLinkedList()
{
Node *current = head;
Node *prev = NULL;
Node *next = NULL;
while (current != NULL)
{
next = current->next;
current->next = prev;
prev = current;
current = next;
}
head = prev;
}
void printLinkedList()
{
Node *temp = head;
while (temp != NULL)
{
cout << temp->data << " ";
temp = temp->next;
}
}
void pushData(int data)
{
Node *temp = new Node(data);
temp->next = head;
head = temp;
}
};
int main()
{
LinkedList l;
l.pushData(1);
l.pushData(2);
l.pushData(3);
l.pushData(4);
cout << "Given linked list is: ";
l.printLinkedList();
l.reverseLinkedList();
cout << "\nReverse linked list is: ";
l.printLinkedList();
return 0;
}