Let SLLdel be a function that deletes a node in a singly-linked list given a…

GATE · 2023 · CS · Computer Science & IT

Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be another function that deletes a node in a doubly-linked list given a pointer to the node and a pointer to the head of the list. Let n denote the number of nodes in each of the linked lists. Which one of the following choices is TRUE about the worst-case time complexity of SLLdel and DLLdel?

  1. A.

    SLLdel is O(1) and DLLdel is O(n)

  2. B.

    Both SLLdel and DLLdel are O(log(n))

  3. C.

    Both SLLdel and DLLdel are O(1)

  4. D.

    SLLdel is O(n) and DLLdel is O(1)

Attempted by 646 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…