-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathsingly-linked-list.function.js
More file actions
169 lines (158 loc) · 3.86 KB
/
singly-linked-list.function.js
File metadata and controls
169 lines (158 loc) · 3.86 KB
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
165
166
167
168
169
/**
* Singly Linked list consists of a number of nodes in which each node has
* a next pointer to the following element. The link of the last node in the
* list is NULL, which indicates the end of the list.
*/
/**
* Type declaration for node of singly linked list
* @param data
* @param next
* @constructor
*/
function Node(data = null, next = null) {
this.data = data;
this.next = next;
}
/**
* Type declaration for Singly Linked List
* @constructor
*/
function SinglyLinkedList() {
this.head = null;
this.size = 0;
/**
* Insert a node at given position
* @param data
* @param index
* @return {{head: *, success: boolean, message: string}}
*/
this.insertNode = function(data, index = this.size) {
if(index > this.size) {
return {
success: false,
message: 'Error in inserting Node',
head: this.head
};
}
const node = new Node(data);
if(index === 0) {
node.next = this.head;
this.head = node;
this.size++;
return {
success: true,
message: 'Node inserted successfully',
head: this.head
};
}
let start = 0;
let current = this.head;
while(current) {
if(start === index-1) {
break;
}
current = current.next;
start++;
}
node.next = current.next;
current.next = node;
this.size++;
return {
success: true,
message: 'Node inserted successfully',
head: this.head
};
};
/**
* Traverse list
*/
this.traverse = function() {
let current = this.head;
while(current) {
console.log(current.data);
current = current.next;
}
};
/**
* Delete a node at given position
* @param index
* @return {{head: *, success: boolean, message: string}}
*/
this.deleteNode = function(index = this.size-1) {
if(index > this.size) {
return {
success: false,
message: 'Error in deleting Node',
head: this.head
};
}
if(index === 0) {
this.head = this.head.next;
this.size--;
return {
success: true,
message: 'Node deleted successfully',
head: this.head
};
}
let current = this.head;
let start = 0;
while(current) {
if(start === index-1) {
break;
}
current = current.next;
start++;
}
current.next = current.next.next;
this.size--;
return {
success: true,
message: 'Node deleted successfully',
head: this.head
};
};
/**
* Get node at given position
* @param index
* @return {null|Node|*|null}
*/
this.getNode = function(index) {
if(index >= this.size) {
return null;
}
let current = this.head;
let start = 0;
while(current) {
if(start === index) {
break;
}
current = current.next;
start++;
}
return current;
};
/**
* Delete list
* @return {{head: *, success: boolean, message: string}}
*/
this.deleteList = function() {
this.head = null;
return {
success: true,
message: 'list deleted successfully',
head: this.head,
}
};
/**
* Get size of list
* @return {number}
*/
this.getSize = function() {
return this.size;
}
}
module.exports = {
SinglyLinkedList,
Node
};