-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathDoubleLinkedList.py
148 lines (122 loc) · 4.12 KB
/
DoubleLinkedList.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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
import time
from pympler import asizeof
class Node:
length=0
head=None
def __init__(self,data=None,preNode=None,nextNode=None):
self.data=data
self.preNode=preNode
self.nextNode=nextNode
def get_data(self):
return self.data
def get_pre_node(self):
return self.preNode
def get_nextnode(self):
return self.nextNode
def set_data(self, value):
self.data = value
def set_pre_node(self, value):
self.preNode = value
def set_nextnode(self, value):
self.nextNode = value
def hasNext(self):
return self.nextNode()!=None
def insertValueAtStarting(self,value):
current=self.head
newNode=Node()
newNode.set_data(value)
if self.length==0:
self.head=newNode
else:
newNode.set_pre_node(None)
newNode.set_nextnode(current)
current.set_pre_node(newNode)
self.head=newNode
self.length+=1
def Display(self):
currentNode=self.head
print("From Starting to end : ",currentNode.get_data() ,end=" ")
while currentNode.get_nextnode()!=None:
currentNode=currentNode.get_nextnode()
print(currentNode.get_data(),end=" ")
print()
print("From back to front : ",currentNode.get_data() ,end=" ")
while currentNode.get_pre_node()!=None:
currentNode=currentNode.get_pre_node()
print(currentNode.get_data(),end=" ")
def insertValueInLast(self,value):
currentNode=self.head
while currentNode.get_nextnode()!=None:
currentNode=currentNode.get_nextnode()
newNode=Node()
newNode.data=value
newNode.set_nextnode(None)
newNode.set_pre_node(currentNode)
currentNode.set_nextnode(newNode)
self.length+=1
def addValueAfter(self,data,value):
currentNode=self.head
prevNode=None
while currentNode.get_data()!= value:
prevNode=currentNode
currentNode=currentNode.get_nextnode()
prevNode=currentNode
currentNode=currentNode.get_nextnode()
newNode=Node()
newNode.set_data(data)
newNode.set_nextnode(currentNode)
newNode.set_pre_node(prevNode)
currentNode.set_pre_node(newNode)
prevNode.set_nextnode(newNode)
self.length+=1
def deleteAtStarting(self):
currentNode=self.head
self.head=currentNode.get_nextnode()
self.head.set_pre_node(None)
self.length-=1
def deleteAtEnding(self):
currentNode=self.head
preNode=None
while currentNode.get_nextnode()!=None:
preNode=currentNode
currentNode=currentNode.get_nextnode()
preNode.set_nextnode(None)
currentNode.set_pre_node(None)
self.length-=1
del currentNode
# ''def inserValueAtEnd(self,value):
# currentNode=self.head
# while currentNode.get_nextnode()!=None :
# currentNode=currentNode.get_nextnode()
# newNode=Node()
# newNode.set_data(value)
# newNode.set_pre_node(currentNode)
# newNode.get_nextnode(None)
# currentNode.get_nextnode(newNode)
# self.length+=1
# et=time.time()
# head=Node()
# #Size In bytes
# print("\nMemory 0st node : ",asizeof.asizeof(head))
# head.insertValueAtStarting(21)
# print("\nMemory 1st node : ",asizeof.asizeof(head))
# head.insertValueAtStarting(22)
#
# print("\nMemory 2nd node : ",asizeof.asizeof(head))
# head.insertValueAtStarting(24)
#
# print("\nMemory 3nd node : ",asizeof.asizeof(head))
# head.insertValueAtStarting(23)
#
# print("\nMemory 4nd node : ",asizeof.asizeof(head))
# head.insertValueInLast(100)
#
# print("\nMemory 5nd node : ",asizeof.asizeof(head))
# head.addValueAfter(215, 22)
#
# head.deleteAtStarting()
# head.deleteAtEnding()
# head.Display()
# print("\nMemory : ",asizeof.asizeof(head))
# print("List Length : ",head.length)
# print("Time to do : ",time.time()-et)