GATEverse Practice, past papers & mock tests
GATE 2023 · CS - Forenoon
Programming & Data StructuresLinked ListmediumMCQ1 mark
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?
Save your progress

Related Programming & Data Structures PYQs