###### Data-Structures

October 16, 2023###### GATE 2022

October 16, 2023# GATE 2023

Question 13 |

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?

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

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

Both SLLdel and DLLdel are O(1) | |

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

Correct Answer: D

Subscribe

Login

0 Comments