An ordered set of items from which items may be deleted at either end and into which items may be inserted at either end is called.

  • Home
  • Blog
  • An ordered set of items from which items may be deleted at either end and into which items may be inserted at either end is called.
About

An ordered set of items from which items may be deleted at either end and into which items may be inserted at either end is called.

in C and CPP 

1.3 An ordered set of items from which items may be deleted at either end and into which
items may be inserted at either end is called.
A) Queue
B) Stack
C) Heap
D) Dequeue

Leave a Reply