-
Notifications
You must be signed in to change notification settings - Fork 0
/
reverseList.cpp
55 lines (41 loc) · 931 Bytes
/
reverseList.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
#include <iostream>
#include <cstdlib>
using namespace std;
struct node {
int data;
struct node* next;
};
void insert(struct node** headRef, int data)
{
struct node* newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = data;
newNode->next = *headRef;
*headRef = newNode;
}
void printList(struct node* head){
struct node* current = head;
while (current != NULL){
cout<<current->data<<" ";
current = current->next;
}
cout<<endl;
}
void reverseList(struct node** headRef){
struct node* first = *headRef;
if (first == NULL) return;
struct node* rest = first->next;
if (rest == NULL) return;
reverseList(&rest);
first->next->next = first;
first->next = NULL;
*headRef = rest;
}
int main() {
struct node* head = NULL;
insert(&head,3);
insert(&head,2);
insert(&head,1);
printList(head);
reverseList(&head);
printList(head);
}