- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures - List
- Which of the following is false about a ...

Q. |
## Which of the following is false about a circular linked list? |

A. | Every node has a successor |

B. | Time complexity of inserting a new node at the head of the list is O(1) |

C. | Time complexity for deleting the last node is O(n) |

D. | We can traverse the whole circular linked list by starting from any point |

Answer» B. Time complexity of inserting a new node at the head of the list is O(1) |

View all MCQs in:
Data Structures (DS)

- What differentiates a circular linked list from a normal linked list?
- Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
- Which of the following application makes use of a circular linked list?
- What is the time complexity of searching for an element in a circular linked list?
- The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
- Which of the following is false about a doubly linked list?
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
- 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?
- A linked list whose last node points back to the list node instead of containing the null pointer________.
- The _________ for a linked list is a pointer variable that locates the beginning of the list.

Login to Continue

It will take less than 2 minutes

Report MCQ