Which of the following operations is performed more efficiently by doubly linked list than by singly linked list? Data Structure
- Deleting a node whose location in given
- Searching of an unsorted list for a given item
- Inverting a node after the node with given location
- Traversing a list to process each node
Answer: Deleting a node whose location in given
- Bookmark
- Add Comment
- Share With Friends
- Report
MCQs on Linked list with answers
- Topics >>
- Placement papers >>
- Data Structure Placement papers - Model questions & answers-02/19/15
- « Previous
- Next »
Which of the following operations is performed more efficiently by doubly linked list than by singly linked listA Deleting a node whose location is given.B Searching of an unsorted list for a given item.C Inserting a new node after node whose location is given.D Traversing the list to process each node.
Answer :