Code required. Extending from the Queue class: class Queue: def __init__(self):

Question

Code required.

Extending from the Queue class:

class Queue:
def __init__(self):
self.list = []
  
def is_empty(self):
return self.list == []
  
def enqueue(self, item):
self.list.insert(0,item)
  
def dequeue(self):
return self.list.pop()
  
def peek(self):
if self.list == []:
return
else:
return self.list[len(self.list)-1]

Extend the Queue class by adding the method splice(self, second_queue). The splice method combines two queues by adding all elements of a second queue to the end of the first queue. The second_queue should not be altered when the method completes. For full credit, you must take advantage of being able to directly access the elements of second_queue You should include the entire Queue class definition in your answer to this question. For example Test Result my_queueQueue() my_queue.enqueue('1') my_queue.enqueue ('2) my_queue.enqueue('3') another_queueQueue) another_queue.enqueue'4') another_queue.enqueue'5') my_queue.splice(another_queue) print(my_queue) print(another_queue) 5 4 3 2 1 5 4 my_queue Queue() my_queue.enqueue('4) my_queue.enqueue('5') another_queue Queue() my_queue.splice(another_queue) print (my_queue) 5 4

Explanation / Answer

class Queue: def __init__(self): self.list = [] def is_empty(self): return self.list == [] def enqueue(self, item): self.list.insert(0, item) def dequeue(self): return self.list.pop() def peek(self): if self.list == []: return else: return self.list[len(self.list) - 1] def size(self): return len(self.list) def __str__(self): str_q = '' for item in self.list: str_q = str_q + item + ' ' return str_q def splice(self, second_queue): for i in range(len(second_queue.list)-1, -1, -1): self.enqueue(second_queue.list[i])

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---