-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSingly Linked List.py
More file actions
88 lines (70 loc) · 1.91 KB
/
Singly Linked List.py
File metadata and controls
88 lines (70 loc) · 1.91 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
# -*- coding: utf-8 -*-
"""
Created on Mon Aug 17 21:04:52 2020
@author: rahul
"""
class Node:
def __init__(self, data):
self.data = data
self.next = None
class SinglyLinkedList:
class Iterator:
def __init__(self, head):
self.current = head
def __next__(self):
if self.current is None:
raise StopIteration
item = self.current.data
self.current = self.current.next
return item
def __repr__(self):
arr = []
node = self.head
while node:
arr.append(node.data)
node = node.next
return str(arr)
def __init__(self):
self.size = 0
self.head = None
def insert(self, data):
if self.size == 0:
self.head = Node(data)
self.size += 1
return
node = Node(data)
node.next = self.head
self.head = node
self.size += 1
return
def insertAfter(self, prev_node, item):
if not prev_node:
raise Error('Previous node cannot be None')
node = Node(item)
node.next = prev_node.next
prev_node.next = node
def search(self, item):
node = self.head
while node and node.data != item:
node = node.next
return node
def delete(self, item):
prev_node = self.head
next_node = prev_node.next
if prev_node.data == item:
self.head = next_node
del (prev_node)
return
while next_node and next_node.data != item:
prev_node = next_node
next_node = next_node.next
if next_node:
prev_node.next = next_node.next
del (next_node)
def __iter__(self):
return self.Iterator(self.head)
class Error(Exception):
pass
l = SinglyLinkedList()
for x in [1, 2, 5, 4]:
l.insert(x)