Question

0) Write a program to perform insert and delete operations on a Queue containing Members details as
given in the following definition of item node:
Member No
integer
Member Name String
Age
integer
der is Empty (ou):
if Qu -- 0):
return True
else:
return false
def Enqueue (Qu, item):
* Write the code to insert member details using Queue.
def Dequeue (Qu):
# Write the code to delete a member using Queue.​

Answer 1

dihb. um BBC z,gyv ol mbz at

Answer 2

Answer:

In the previous post, we introduced Queue and discussed array implementation. In this post, linked list implementation is discussed. The following two main operations must be implemented efficiently.

In a Queue data structure, we maintain two pointers, front and rear. The front points the first item of queue and rear points to last item.

enQueue() This operation adds a new node after rear and moves rear to the next node.

deQueue() This operation removes the front node and moves front to the next node.

plzz mark me as brainlist

give me thanks for the answering

and follow my two friends also plzz