McqMate

Q. |
## What is the space complexity for deleting a linked list? |

A. | O(1) |

B. | O(n) |

C. | Either O(1) or O(n) |

D. | O(logn) |

Answer» A. O(1) |

2.2k

0

Do you find this helpful?

12

View all MCQs in

Data Structures (DS)No comments yet

- Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
- Worst space complexity of singly linked list is
- What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
- What differentiates a circular linked list from a normal linked list?
- What differentiates a circular linked list from a normal linked list?
- The worst case complexity of deleting any arbitrary node value element from heap is
- What is the time complexity to count the number of elements in the linked list?
- What is the worst case time complexity of inserting a node in a doubly linked list?
- What is the time complexity of searching for an element in a circular linked list?
- What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?