- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures - List
- What would be the asymptotic time comple...

Q. |
## 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. | O(1) |

B. | O(n) |

C. | θ(n) |

D. | θ(1) |

Answer» C. θ(n) |

View all MCQs in:
Data Structures (DS)

- 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 find an element in the linked list?
- What would be the asymptotic time complexity to insert an element at the second position in the linked list?
- A linked list whose last node points back to the list node instead of containing the null pointer________.
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
- What is the worst case time complexity of inserting a node in a doubly linked list?
- Each node in a singly linked lists have ______ fields
- To insert a new node in linked list free node will be available in ___________.
- The _________ for a linked list is a pointer variable that locates the beginning of the list.
- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

Login to Continue

It will take less than 2 minutes

Report MCQ