-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdeletion.py
93 lines (88 loc) · 2.39 KB
/
deletion.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
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
92
93
class Node:
def __init__(self,data,next):
self.data = data
self.next = next
class LinkedList:
def __init__(self):
self.head = None
def append(self,data):
tmp = Node(data,None)
if self.head == None:
self.head = tmp
else:
temp = self.head
while temp.next is not None:
temp = temp.next
temp.next = tmp
def print(self):
t = self.head
while t is not None:
print(t.data)
t = t.next
def push(self,data):
tmp = Node(data,None)
tmp.next = self.head
self.head = tmp
def insert(self,index,element):
tmp = Node(element,None)
temp = self.head
while temp.data != index:
temp = temp.next
tmp.next = temp.next
temp.next = tmp
def delete(self,datas):
temp = self.head
prev = None
if temp is not None:
if temp.data == datas:
self.head = temp.next
temp = None
return
while temp.data != datas:
prev = temp
temp = temp.next
prev.next = temp.next
temp = None
def deletepos(self,e):
temp = self.head
if e == 0:
self.head = temp.next
temp = None
return
for i in range(e - 1):
temp = temp.next
if temp is None:
break
if temp is None:
return
if temp.next is None:
return
de = temp.next.next
temp.next = de
def full_delete(self):
self.head = None
def length(self):
count = 0
temp =self.head
while temp:
count+=1
temp = temp.next
return count
def lenghtl(self,hello):
if hello == None:
return 0
else:
return self.lenghtl(hello.next)+1
def lengthk(self):
return self.lenghtl(self.head)
if __name__ == '__main__':
LinkedLists = LinkedList()
LinkedLists.append(10)
LinkedLists.append(20)
LinkedLists.append(30)
LinkedLists.append(50)
#LinkedLists.delete(50)
#LinkedLists.deletepos(3)
#LinkedLists.full_delete()
print(LinkedLists.lengthk())
print("deleted")