McqMate

Q. |
## What would be the asymptotic time complexity to find an element in the linked list? |

A. | O(1) |

B. | O(n) |

C. | O(n2) |

D. | O(n4) |

Answer» B. O(n) |

2k

0

Do you find this helpful?

18

View all MCQs in

Data Structures (DS)No comments yet

- 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 would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
- What would be the asymptotic time complexity to insert an element at the second position in the linked list?
- 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.
- What is the time complexity of searching for an element in a circular linked list?
- What differentiates a circular linked list from a normal linked list?
- What differentiates a circular linked list from a normal linked list?
- 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?
- In a linked list the _________field contains the address of next element in the list.