Skip to content

Commit 74d57d8

Browse files
OmkarPathakOmkarPathak
committed
Linked List implementation in Python
1 parent 59992e4 commit 74d57d8

File tree

1 file changed

+359
-0
lines changed

1 file changed

+359
-0
lines changed

‎Linked Lists/Linked Lists.ipynb

+359
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,359 @@
1+
{
2+
"cells": [
3+
{
4+
"cell_type": "markdown",
5+
"metadata": {},
6+
"source": [
7+
"#### Author: OMKAR PATHAK"
8+
]
9+
},
10+
{
11+
"cell_type": "markdown",
12+
"metadata": {},
13+
"source": [
14+
"# Linked Lists"
15+
]
16+
},
17+
{
18+
"cell_type": "markdown",
19+
"metadata": {},
20+
"source": [
21+
"### What are Linked Lists?"
22+
]
23+
},
24+
{
25+
"cell_type": "markdown",
26+
"metadata": {},
27+
"source": [
28+
"A linked List is a data structure used for storing collections of data. A linked list has the following properties.\n",
29+
"* Successive elements a re connected by pointers\n",
30+
"* The last element points to NULL(__None__ in Python)\n",
31+
"* Can grow or shrink in size during execution of a program\n",
32+
"* Can be made just as long as required (until systems memory exhausts)\n",
33+
"* Does not waste memory space (but takes some extra memory for pointers)"
34+
]
35+
},
36+
{
37+
"cell_type": "markdown",
38+
"metadata": {},
39+
"source": [
40+
"### Properties of Linked Lists:"
41+
]
42+
},
43+
{
44+
"cell_type": "markdown",
45+
"metadata": {},
46+
"source": [
47+
"* Linked lists are linear data structures that hold data in individual objects called nodes. These nodes hold both the data and a reference to the next node in the list.\n",
48+
"* Each node contains a value, and a reference (also known as a pointer) to the next node. The last node, points to a null node. This means the list is at its end.\n",
49+
"* Linked lists offer some important advantages over other linear data structures. Unlike arrays, they are a dynamic data structure, resizable at run-time. Also, the insertion and deletion operations are efficient and easily implemented.\n",
50+
"* However, linked lists do have some drawbacks. Unlike arrays, linked lists aren't fast at finding the __n__th item.To find a node at position __n__, you have to start the search at the first node in the linked list, following the path of references times. Also, because linked lists are inherently sequential in the forward direction, operations like backwards traversal--visiting every node starting from the end and ending in the front--is especially cumbersome. (__Only sequential search possible__)\n",
51+
"* Additionally, linked lists use more storage than the array due to their property of referencing the next node in the linked list.\n",
52+
"* Finally, unlike an array whose values are all stored in contiguous memory, a linked list's nodes are at arbitrary, possibly far apart locations in memory."
53+
]
54+
},
55+
{
56+
"cell_type": "markdown",
57+
"metadata": {},
58+
"source": [
59+
"### Common Operations:\n",
60+
"* Insert \n",
61+
"* Insert at end\n",
62+
"* Insert at beginning\n",
63+
"* Insert between\n",
64+
"* Delete \n",
65+
"* Search \n",
66+
"* Indexing"
67+
]
68+
},
69+
{
70+
"cell_type": "markdown",
71+
"metadata": {},
72+
"source": [
73+
"### Time Complexity:"
74+
]
75+
},
76+
{
77+
"cell_type": "markdown",
78+
"metadata": {},
79+
"source": [
80+
"* Insertion: O(1)\n",
81+
" * Insertion at beginning (or front): O(1)\n",
82+
" * Insertion in between: O(1)\n",
83+
" * Insertion at End: O(n)\n",
84+
"* Deletion: O(1)\n",
85+
"* Indexing: O(n)\n",
86+
"* Searching: O(n)"
87+
]
88+
},
89+
{
90+
"cell_type": "markdown",
91+
"metadata": {},
92+
"source": [
93+
"### Implementing Singly Linked List:"
94+
]
95+
},
96+
{
97+
"cell_type": "code",
98+
"execution_count": 1,
99+
"metadata": {},
100+
"outputs": [
101+
{
102+
"name": "stdout",
103+
"output_type": "stream",
104+
"text": [
105+
"4 1 2 5 3 6 \n",
106+
"4 1 2 5 6 \n",
107+
"True\n"
108+
]
109+
}
110+
],
111+
"source": [
112+
"# Linked List and Node can be accomodated in separate classes for convenience\n",
113+
"class Node(object):\n",
114+
" # Each node has its data and a pointer that points to next node in the Linked List\n",
115+
" def __init__(self, data, next = None):\n",
116+
" self.data = data;\n",
117+
" self.next = next;\n",
118+
" \n",
119+
" # function to set data\n",
120+
" def setData(self, data):\n",
121+
" self.data = data;\n",
122+
" \n",
123+
" # function to get data of a particular node\n",
124+
" def getData(self):\n",
125+
" return self.data\n",
126+
" \n",
127+
" # function to set next node\n",
128+
" def setNext(self, next):\n",
129+
" self.next = next\n",
130+
" \n",
131+
" # function to get the next node\n",
132+
" def getNext(self):\n",
133+
" return self.next\n",
134+
" \n",
135+
"class LinkedList(object):\n",
136+
" # Defining the head of the linked list\n",
137+
" def __init__(self):\n",
138+
" self.head = None\n",
139+
" \n",
140+
" # printing the data in the linked list\n",
141+
" def printLinkedList(self):\n",
142+
" temp = self.head\n",
143+
" while(temp):\n",
144+
" print(temp.data, end=' ')\n",
145+
" temp = temp.next\n",
146+
" \n",
147+
" # inserting the node at the beginning\n",
148+
" def insertAtStart(self, data):\n",
149+
" newNode = Node(data)\n",
150+
" newNode.next = self.head\n",
151+
" self.head = newNode\n",
152+
" \n",
153+
" # inserting the node in between the linked list (after a specific node)\n",
154+
" def insertBetween(self, previousNode, data):\n",
155+
" if (previousNode.next is None):\n",
156+
" print('Previous node should have next node!')\n",
157+
" else:\n",
158+
" newNode = Node(data)\n",
159+
" newNode.next = previousNode.next\n",
160+
" previousNode.next = newNode\n",
161+
" \n",
162+
" # inserting at the end of linked list\n",
163+
" def insertAtEnd(self, data):\n",
164+
" newNode = Node(data)\n",
165+
" temp = self.head\n",
166+
" while(temp.next != None): # get last node\n",
167+
" temp = temp.next\n",
168+
" temp.next = newNode\n",
169+
" \n",
170+
" # deleting an item based on data(or key)\n",
171+
" def delete(self, data):\n",
172+
" temp = self.head\n",
173+
" # if data/key is found in head node itself\n",
174+
" if (temp.next is not None):\n",
175+
" if(temp.data == data):\n",
176+
" self.head = temp.next\n",
177+
" temp = None\n",
178+
" return\n",
179+
" else:\n",
180+
" # else search all the nodes\n",
181+
" while(temp.next != None):\n",
182+
" if(temp.data == data):\n",
183+
" break\n",
184+
" prev = temp #save current node as previous so that we can go on to next node\n",
185+
" temp = temp.next\n",
186+
" \n",
187+
" # node not found\n",
188+
" if temp == None:\n",
189+
" return\n",
190+
" \n",
191+
" prev.next = temp.next\n",
192+
" return\n",
193+
" \n",
194+
" # iterative search\n",
195+
" def search(self, node, data):\n",
196+
" if node == None:\n",
197+
" return False\n",
198+
" if node.data == data:\n",
199+
" return True\n",
200+
" return self.search(node.getNext(), data)\n",
201+
" \n",
202+
"if __name__ == '__main__':\n",
203+
" List = LinkedList()\n",
204+
" List.head = Node(1) # create the head node\n",
205+
" node2 = Node(2)\n",
206+
" List.head.setNext(node2) # head node's next --> node2\n",
207+
" node3 = Node(3)\n",
208+
" node2.setNext(node3) # node2's next --> node3\n",
209+
" List.insertAtStart(4) # node4's next --> head-node --> node2 --> node3\n",
210+
" List.insertBetween(node2, 5) # node2's next --> node5\n",
211+
" List.insertAtEnd(6)\n",
212+
" List.printLinkedList()\n",
213+
" print()\n",
214+
" List.delete(3)\n",
215+
" List.printLinkedList()\n",
216+
" print()\n",
217+
" print(List.search(List.head, 1))"
218+
]
219+
},
220+
{
221+
"cell_type": "markdown",
222+
"metadata": {},
223+
"source": [
224+
"### Some Important Points"
225+
]
226+
},
227+
{
228+
"cell_type": "markdown",
229+
"metadata": {},
230+
"source": [
231+
"* In general, __array__ is considered a data structure for which size is fixed at the compile time and array memory is allocated either from __Data section__ (e.g. global array) or __Stack section__ (e.g. local array). \n",
232+
"* Similarly, linked list is considered a data structure for which size is not fixed and memory is allocated from __Heap section__ (e.g. using malloc() etc.) as and when needed. In this sense, array is taken as a static data structure (residing in Data or Stack section) while linked list is taken as a dynamic data structure (residing in Heap section).\n",
233+
"* The array elements are allocated memory in sequence i.e. __contiguous memory__ while nodes of a linked list are non-contiguous in memory. Though it sounds trivial yet this is the most important difference between array and linked list. It should be noted that due to this contiguous versus non-contiguous memory, array and linked list are different."
234+
]
235+
},
236+
{
237+
"cell_type": "markdown",
238+
"metadata": {},
239+
"source": [
240+
"### Implementing Doubly Linked List:"
241+
]
242+
},
243+
{
244+
"cell_type": "code",
245+
"execution_count": 22,
246+
"metadata": {},
247+
"outputs": [
248+
{
249+
"name": "stdout",
250+
"output_type": "stream",
251+
"text": [
252+
"4 2 1 3 \n",
253+
"4 1 3 "
254+
]
255+
}
256+
],
257+
"source": [
258+
"class Node(object):\n",
259+
" # Each node has its data and a pointer that points to next node in the Linked List\n",
260+
" def __init__(self, data, next = None, previous = None):\n",
261+
" self.data = data;\n",
262+
" self.next = next;\n",
263+
" self.previous = previous\n",
264+
" \n",
265+
"class DoublyLinkedList(object):\n",
266+
" def __init__(self):\n",
267+
" self.head = None\n",
268+
" \n",
269+
" # for inserting at beginning of linked list\n",
270+
" def insertAtStart(self, data):\n",
271+
" if self.head == None:\n",
272+
" newNode = Node(data)\n",
273+
" self.head = newNode\n",
274+
" else:\n",
275+
" newNode = Node(data)\n",
276+
" self.head.previous = newNode\n",
277+
" newNode.next = self.head\n",
278+
" self.head = newNode\n",
279+
" \n",
280+
" # for inserting at end of linked list\n",
281+
" def insertAtEnd(self, data):\n",
282+
" newNode = Node(data)\n",
283+
" temp = self.head\n",
284+
" while(temp.next != None):\n",
285+
" temp = temp.next\n",
286+
" temp.next = newNode\n",
287+
" newNode.previous = temp\n",
288+
" \n",
289+
" # deleting a node from linked list\n",
290+
" def delete(self, data):\n",
291+
" temp = self.head\n",
292+
" if(temp.next != None):\n",
293+
" # if head node is to be deleted\n",
294+
" if(temp.data == data):\n",
295+
" temp.next.previous = None\n",
296+
" self.head = temp.next\n",
297+
" temp.next = None\n",
298+
" return\n",
299+
" else:\n",
300+
" while(temp.next != None):\n",
301+
" if(temp.data == data):\n",
302+
" break\n",
303+
" temp = temp.next\n",
304+
" if(temp.next):\n",
305+
" # if element to be deleted is in between\n",
306+
" temp.previous.next = temp.next\n",
307+
" temp.next.previous = temp.previous\n",
308+
" temp.next = None\n",
309+
" temp.previous = None\n",
310+
" else:\n",
311+
" # if element to be deleted is the last element\n",
312+
" temp.previous.next = None\n",
313+
" temp.previous = None\n",
314+
" return\n",
315+
" \n",
316+
" if (temp == None):\n",
317+
" return\n",
318+
" \n",
319+
" # for printing the contents of linked lists\n",
320+
" def printdll(self):\n",
321+
" temp = self.head\n",
322+
" while(temp != None):\n",
323+
" print(temp.data, end=' ')\n",
324+
" temp = temp.next\n",
325+
" \n",
326+
"dll = DoublyLinkedList()\n",
327+
"dll.insertAtStart(1)\n",
328+
"dll.insertAtStart(2)\n",
329+
"dll.insertAtEnd(3)\n",
330+
"dll.insertAtStart(4)\n",
331+
"dll.printdll()\n",
332+
"dll.delete(2)\n",
333+
"print()\n",
334+
"dll.printdll()"
335+
]
336+
}
337+
],
338+
"metadata": {
339+
"kernelspec": {
340+
"display_name": "Python 3",
341+
"language": "python",
342+
"name": "python3"
343+
},
344+
"language_info": {
345+
"codemirror_mode": {
346+
"name": "ipython",
347+
"version": 3
348+
},
349+
"file_extension": ".py",
350+
"mimetype": "text/x-python",
351+
"name": "python",
352+
"nbconvert_exporter": "python",
353+
"pygments_lexer": "ipython3",
354+
"version": "3.5.2"
355+
}
356+
},
357+
"nbformat": 4,
358+
"nbformat_minor": 2
359+
}

0 commit comments

Comments
 (0)