-
Notifications
You must be signed in to change notification settings - Fork 0
/
reverseLinkedList.cpp
65 lines (59 loc) · 1.48 KB
/
reverseLinkedList.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
#include<iostream>
using namespace std;
struct node{
int n;
struct node *next;
};
void push(struct node **head, int n)
{
struct node* newNode = (struct node *)malloc(sizeof(struct node));
newNode->n = n;
newNode->next = *head;
*head = newNode;
}
void swapAdjacent(struct node **head)
{
struct node* currNode = NULL;
struct node* prevNode = NULL;
prevNode = *head;
currNode = (*head)->next;
*head = currNode;
while(true)
{
struct node * next = currNode->next;
currNode->next = prevNode;
if(next == NULL || next->next == NULL){
prevNode->next = next;
break;
}
prevNode -> next = next->next;
prevNode = next;
currNode = prevNode->next;
}
}
void printList(struct node *head)
{
struct node* temp = head;
while(temp->next != NULL)
{
cout<<temp->n<<endl;
temp = temp->next;
}
}
int main()
{
struct node* head = NULL;
push(&head, 1);
push(&head, 2);
push(&head, 3);
push(&head, 4);
push(&head, 5);
push(&head, 6);
push(&head, 7);
cout<<"List Before Swapping" <<endl;
printList(head);
swapAdjacent(&head);
cout<<"List After Swapping" <<endl;
printList(head);
return 0;
}