A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is? Q & A › A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is? 0 Vote Up Vote Down Admin Staff asked 4 years ago A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is? a) Queue b) Circular queue c) Dequeue d) Priority queue Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago c) Dequeue Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...
Admin