GATE CS 2023 (Forenoon) — Question 13

Data StructuresLinked Lists & Binary TreesMCQ1 mark · −1/3 if wrongEasy

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) \)
Practise the full 2023-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Linked Lists & Binary TreesTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group