Identify the data structure which allows deletions at both ends of the list but insertion at only one ending.

  1. Home

Question:Identify the data structure which allows deletions at both ends of the list but insertion at only one ending.

1.Input-restricted deque

2. Output-restricted deque

3.Priority Queues

4.None of the above

Posted by R4R Team
  1. Identify the data structure which allows deletions at both ends of the list but insertion at only one ending.
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!