-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdeleteLinked_list.py
More file actions
71 lines (63 loc) · 1.65 KB
/
deleteLinked_list.py
File metadata and controls
71 lines (63 loc) · 1.65 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
class Node:
def __init__(self,data):
self.data=data
self.next=None
class LinkedList:
def __init__(self):
self.head=None
def insertBeg(self,item):
newNode=Node(item)
newNode.next=self.head
self.head=newNode
def insertLast(self,item):
temp=self.head
while temp.next!=None:
temp=temp.next
newnode=Node(item)
newnode.next=None
temp.next=newnode
def insertMiddle(self,item,key):
temp=self.head
while temp.data!=key:
temp=temp.next
newNode=Node(item)
newNode.next=temp.next
temp.next=newNode
def deletemiddle(self,item):
#item = self.middle2()
temp = self.head
while temp.next.data != item:
temp = temp.next
#temp1 = temp.next
temp.next = temp.next.next
#del (temp1) # to free the space
def deletefirst(self):
temp=self.head
temp1=self.head.next
self.head=temp1
del(temp)
def deleteLast(self):
temp=self.head
while(temp.next.next!=None):
temp=temp.next
temp.next=None
def printllist(self):
temp = self.head
while temp:
print(temp.data, end="=>")
temp = temp.next
print("Null")
llist=LinkedList()
llist.insertBeg(4)
llist.insertBeg(3)
llist.insertBeg(2)
llist.insertBeg(1)
llist.printllist()
llist.insertMiddle(6,3)
llist.printllist()
llist.insertLast(5)
llist.printllist()
llist.deletefirst()
llist.printllist()
llist.deleteLast()
llist.printllist()