-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinkedlist.py
More file actions
91 lines (78 loc) · 2.14 KB
/
Copy pathlinkedlist.py
File metadata and controls
91 lines (78 loc) · 2.14 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
class Node:
def __init__(self, data):
self.data = data
self.ref = None
class LinkedList:
def __init__(self):
self.head = None
def traverse(self):
if self.head is None:
print("Linked list is empty")
else:
next = self.head
while next is not None:
print(next.data,'---->',end="")
next = next.ref
print('',end="\n")
def add_begin(self,data):
node = Node(data)
node.ref = self.head
self.head = node
def add_end(self,data):
node = Node(data)
if self.head is None:
self.head = node
else:
n = self.head
while n.ref is not None:
n = n.ref
n.ref = node
def add_after(self,data,number):
new_node = Node(data)
n = self.head
while n.ref is not None:
if n.data == number:
new_node.ref = n.ref
n.ref = new_node
return
else:
n = n.ref
print(number," not found in the list")
def jls_extract_def(self, jls_extract_var):
return jls_extract_var
def add_before(self,data,number):
if self.head is None:
return -1
elif self.head.data == number:
new_node = Node(data)
new_node.ref = self.head
self.head = new_node
return
n = self.head
while n.ref is not None:
if n.ref.data == number:
new_node = Node(data)
new_node.ref = n.ref
n.ref = new_node
return
else:
n = n.ref
print(end="\n")
jls_extract_var = ' not found'
print(number,self.jls_extract_def(jls_extract_var),end="\n")
ll = LinkedList()
ll.traverse()
ll.add_begin(10)
# ll.traverse()
ll.add_begin(20)
ll.add_end(45)
ll.add_begin(120)
ll.add_end(145)
ll.add_after(35, 120)
ll.add_after(21, 20)
ll.add_after(21, 200)
ll.traverse()
ll.add_before(1, 20)
ll.traverse()
ll.add_before(-1, 0)
ll.traverse()