class Stack:
def __init__(self):
self.myList = LinkedList()
def push(self, data):
self.myList.prepend(data)
def pop(self, data):
return self.myList.remove_head()
class Queue:
def __init__(self):
self.myList = LinkedList()
def push(self, data):
self.myList.append(data)
def pop(self, data):
return self.myList.remove_head()
class Stack:
def __init__(self):
self.size = 0
self.storage = LinkedList()
def __len__(self):
return self.size
def push(self, value):
self.size += 1
self.storage.add_to_tail(value)
pass
def pop(self):
if self.size > 0:
self.size = self.size - 1
return self.storage.remove_tail()
class Queue:
def __init__(self):
self.size = 0
self.storage = LinkedList()
def __len__(self):
return self.size
def enqueue(self, value):
self.size += 1
self.storage.add_to_tail(value)
pass
def dequeue(self):
if self.size > 0:
self.size = self.size - 1
return self.storage.remove_head()
pass
def __init__(self):
self.size = 0
self.storage = LinkedList()
def rotate(self, l, k):
for i in range(0, k):
p = l.start
q = l.start
while q.next is not None:
q = q.next
q.next = p
temp = p
p = p.next
l.start = p
temp.next = None
p = l.start
while p is not None:
print p.data,
p = p.next
l = LinkedList()
#l.append(9)
l.append(7)
l.append(6)
l.append(9)
l.append(5)
l.append(1)
l.printlist()
rotateList().rotate(l, 2)
def __init__(self):
self.myList = LinkedList()
q1 = q.next
p1.next = q
q.next = p
p1 = p1.next
q = q1
if q:
p1.next = q
p = l.start
while p is not None:
print p.data,
p = p.next
l = LinkedList()
#l.append(9)
#l.append(7)
#l.append(6)
l.append(9)
l.append(5)
l.append(1)
l.printlist()
m = LinkedList()
#m.append(9)
#m.append(8)
m.append(8)
m.append(3)
m.append(2)
m.printlist()
while i<(length/2):
p=p.next
i+=1
return p.data
#Another Solution
def middlesoln(self,l):
p=l.start
q=l.start
while q and q.next is not None:
p=p.next
q=q.next.next
return p.data
l=LinkedList()
l.append(9)
l.append(8)
l.append(6)
l.append(5)
l.append(3)
l.append(2)
l.printlist()
print middleList().middle(l)
print middleList().middlesoln(l)
from SLL import LinkedList
thisList = LinkedList()
# thisList.addFront(2).addFront(4).addFront(6).addFront(3).addFront(1).deleteFront().contains(4).display().frontValue()
# thisList.addFront(2).addFront(4.3).addFront(6).addFront(-3.5).addFront(1).display().length().maxValue().minValue().avgValue()
# thisList.addFront(9).addFront(-4).addFront(6).addFront(3.5).addFront(1).addLast(7).prependValueAt(8,9).appendValueAt(10,9).deleteValue(7).display()
# thisList.createList([2,"BOO",3,{"userId": 47, "isRobot": True},8,"String",43, False,5,'singleQuotes',98.3001,.09,54,3])
thisList.createList([1, 12, 35, 4, -15]).display().max2Back().display()
def full_list(): test_list = LinkedList() test_list.addFirst(5) test_list.addFirst(8) test_list.addFirst(10) return test_list
def init_list(): test_list = LinkedList() return test_list
