-
Notifications
You must be signed in to change notification settings - Fork 19
/
Copy pathdelete-node-linkedlist.cpp
83 lines (73 loc) · 1.44 KB
/
delete-node-linkedlist.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
// Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
// http://www.geeksforgeeks.org/given-only-a-pointer-to-a-node-to-be-deleted-in-a-singly-linked-list-how-do-you-delete-it/
#include <iostream>
#include <cstdio>
using namespace std;
class Node {
public:
int data;
Node* next;
Node(int data) {
this->data = data;
next = NULL;
}
};
class LinkedList {
public:
Node* start;
int size;
LinkedList(Node* start, int size) {
this->start = start;
this->size = size;
}
};
Node* createLinkedList(int size);
void deleteNode(Node* ptr);
void printLL(LinkedList* L);
Node* createLinkedList(int size) {
if (size < 1)
return NULL;
Node* start = new Node(1);
Node* ptr = start;
Node* ptr1;
for (int i=2; i<=size; i++) {
ptr1 = new Node(i);
ptr->next = ptr1;
ptr = ptr->next;
}
return start;
}
void deleteNode(Node* ptr) {
if (!ptr)
return;
Node* ptr1 = ptr->next;
ptr->data = ptr1->data;
ptr->next = ptr1->next;
delete(ptr1);
return;
}
void printLL(LinkedList* L) {
Node* start = L->start;
if (!start) {
cout<<"List empty.."<<endl;
return;
}
while (start) {
cout<<start->data<<" ";
start = start->next;
}
return;
}
int main() {
freopen("input.txt","r",stdin);
int size;
cin>>size;
LinkedList* L = new LinkedList(createLinkedList(size), size);
cout<<"List: ";
printLL(L);
deleteNode(L->start);
cout<<endl<<"List after deleting node: ";
printLL(L);
cout<<endl;
return 0;
}