Explain insertion algorithm of simple queue
Answers
Answered by
2
Answer:
Queue is ordered collection of homogeneous data elements in which insertion and deletion operation take place at two end . insertion allowed from starting of queue called FRONT point and deletion allowed from REAR end only. insertion operation is called ENQUEUE. deletion operation is called DEQUEUE
Answered by
1
Queue is ordered collection of homogeneous data elements in which insertion and deletion operation take place at two end . insertion allowed from starting of queue called FRONT point and deletion allowed from REAR end only. insertion operation is called ENQUEUE. deletion operation is called DEQUEUE
Similar questions