-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcpp-data-structures-linked-list-reverse.cpp
95 lines (71 loc) · 1.3 KB
/
cpp-data-structures-linked-list-reverse.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
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
#include <iostream>
using namespace std;
struct Node {
int data; // data member
struct Node* next; // self-referencial member pointer
}
*first = NULL;
void create(int A[], int n) // creating a linked list from an array
{
int i;
struct Node* t, * last;
first = new Node;
first->data = A[0];
first->next = NULL;
last = first;
for (i = 1; i < n; i++)
{
t = new Node;
t->data = A[i];
t->next = NULL;
last->next = t;
last = t;
}
}
void Display(struct Node* p) // display the linked list elements
{
while (p != NULL)
{
cout << p->data << " ";
p = p->next;
}
cout << endl;
}
void Reverse(struct Node* p) // reverse a linked list
{
cout << "Reversing..." << endl;
p = first;
Node* q = NULL;
Node *r = NULL;
while (p != NULL)
{
r = q;
q = p;
p = p->next;
q->next = r;
}
first = q;
}
void RecReverse (struct Node *q, struct Node *p) // reverse linked list recursively
{
if (p)
{
RecReverse(p, p->next);
p->next = q;
}
else
{
first = q;
cout << "Reversing recursively..." << endl;
}
}
int main() {
int A[] = { 1,5,5,7,9,11,11,13,15,16 };
create(A, 10);
Display(first);
Reverse(first);
Display(first);
RecReverse(NULL, first); // q starts at NULL and p is first
Display(first);
return 0;
}