-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathGFG_ReverseDoublyLL.cpp
164 lines (126 loc) · 2.18 KB
/
GFG_ReverseDoublyLL.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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/*
https://practice.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/1#
Reverse a Doubly Linked List
*/
// { Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node * next;
Node * prev;
Node (int x)
{
data=x;
next=NULL;
prev=NULL;
}
};
Node *newNode(int data)
{
Node *temp=new Node(data);
return temp;
}
void displayList(Node *head)
{
//Head to Tail
while(head->next)
{
cout<<head->data<<" ";
head=head->next;
}
cout<<head->data;
}
int getLength(Node * head)
{
Node *temp=head;
int count=0;
while(temp->next!=head)
{
count++;
temp=temp->next;
}
return count+1;
}
bool verify(Node* head)
{
int fl=0;
int bl=0;
Node *temp=head;
while(temp->next)
{
temp=temp->next;
fl++;
}
while(temp->prev)
{
temp=temp->prev;
bl++;
}
return fl==bl;
}
// } Driver Code Ends
/*
struct Node
{
int data;
Node * next;
Node * prev;
Node (int x)
{
data=x;
next=NULL;
prev=NULL;
}
};
*/
Node* reverseDLL(Node * head)
{
if(!head || !head->next)
return head;
Node* cur = head;
Node* back = nullptr;
Node* cnxt = nullptr;
while(cur)
{
cnxt = cur->next;
cur->next = back; //swap prev and next pointer of each node
cur->prev = cnxt;
back = cur;
cur = cnxt;
}
return back;
}
// { Driver Code Starts.
int main() {
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
Node *head=NULL, *tail=NULL;
int x;
cin>>x;
head = newNode(x);
tail = head;
for(int i=0;i<n - 1;i++)
{
cin>>x;
Node* temp=newNode(x);
tail->next=temp;
temp->prev= tail;
tail = temp;
}
head=reverseDLL(head);
if(verify(head))
displayList(head);
else
cout<<"Your pointers are not correctly connected";
cout<<endl;
}
return 0;
}
// } Driver Code Ends