def insertBeg(self, data):
temp = Node(data)
temp.next = self.head
self.head = temp
if self.head.next == None:
self.tail = self.head
return self.head
def insertBeg(self,data):
temp = Node(data)
temp.next = self.head
self.head = temp
if self.head.next == None:
self.tail = self.head
return self.head
def insertAtPos(self, data, pos):
temp = Node(data)
count = 1
curr = self.head
while count < pos - 1:
curr = curr.next
count += 1
storeNext = curr.next
curr.next = temp
temp.next = storeNext
def push_back(self, value):
newnode = Node(value)
temp = self.back
newnode.next = temp
if self.back == None:
self.front = newnode
self.back = newnode
else:
self.back.prev = newnode
self.back = newnode
def push_back(self,value):
newnode = Node(value)
temp = self.back
newnode.next = temp
if self.back == None:
self.front = newnode
self.back = newnode
else:
self.back.prev = newnode
self.back = newnode
def insertAtPos(self,data,pos):
temp = Node(data)
count = 1
curr = self.head
while count < pos-1:
curr = curr.next
count += 1
storeNext=curr.next
curr.next = temp
temp.next = storeNext
def insertEnd(self, data):
temp = Node(data)
temp.next = None
self.tail.next = temp
self.tail = temp
return self.tail
def insertEnd(self,data):
temp = Node(data)
temp.next = None
self.tail.next = temp
self.tail = temp
return self.tail