-
-
Notifications
You must be signed in to change notification settings - Fork 77
/
linked_list.py
61 lines (44 loc) · 1.41 KB
/
linked_list.py
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
class Node:
def __init__(self, data):
self.data = data
self.next = None
class LinkedList:
def __init__(self):
self.head = None
def is_empty(self):
return self.head == None
def push_front(self, data):
new_node = Node(data)
new_node.next = self.head
self.head = new_node
def push_back(self, data):
new_node = Node(data)
current_node = self.head
while current_node.next:
current_node = current_node.next
current_node.next = new_node
def size(self):
current_node = self.head
count = 0
while current_node:
count += 1
current_node = current_node.next
return count
def search(self, item):
current_node = self.head
while current_node and not current_node.data == item:
current_node = current_node.next
return current_node != None and current_node.data == item
def remove(self, item):
if self.head == None:
print('List is empty')
return
current_node = self.head
previous_node = None
while current_node and current_node.data != item:
previous_node = current_node
current_node = current_node.next
if previous_node == None:
self.head = current_node.next
else:
previous_node.next = current_node.next