-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist.py
59 lines (45 loc) · 1.33 KB
/
linkedlist.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
#creation of linked list
class Node:
def __init__(self, dataval=None):
self.dataval = dataval
self.nextval = None
class Single_LinkedList:
def __init__(self):
self.headval = None
def list_print(self):
printval = self.headval
while printval is not None:
print (printval.dataval)
printval = printval.nextval
def add_at_begining(self,data):
new_data = Node(data)
new_data.nextval = self.headval
self.headval = new_data
#to add element in the end
def add_at_end(self,data):
new_data = Node(data)
if self.headval is None:
self.headval = new_data
return
last = self.headval
while(last.nextval):
last = last.nextval
last.nextval=new_data
def add_in_between(self,data,mid_data):
new_data = Node(data)
if mid_data is None:
return
new_data.nextval = mid_data.nextval
mid_data.nextval = new_data
list = Single_LinkedList()
list.headval = Node("1")
e2 = Node("2")
e3 = Node("5")
list.headval.nextval = e2
e2.nextval = e3
list.add_at_begining("6")
list.add_at_end("Thur")
list.list_print()
#using import i.e. exisitng linked list data structure from python
# pip install llist
#from llist import dllist, dllistnode