3 votes 3 votes Suppose you want to delete the name that occurs before ‘Vivek’ in an alphabetical listing. Which one of the following data structures shall be most efficient for this operation? Circular linked list Doubly linked list Linked list Dequeue DS ugcnetcse-june2013-paper3 data-structures + – go_editor asked Jul 17, 2016 recategorized May 30, 2020 by Arjun go_editor 2.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Answer B In given question, we have to search a value and modify the previous node. Only in doubly linked list we have direct access to previous node sh!va answered Jul 17, 2016 sh!va comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes B is the most efficient for this as it is very easy to go backward in it by prev pointer Sanjay Sharma answered Jul 17, 2016 Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.