Suppose you want to delete the name that occurs before “Vivek” in an…

UGC NET 2013

Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation ?

  1. A.

    Circular linked list

  2. B.

    Doubly linked list

  3. C.

    Linked list

  4. D.

    Dequeue

Attempted by 33 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…