- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures - List
- What is the worst case time complexity o...

Q. |
## What is the worst case time complexity of inserting a node in a doubly linked list? |

A. | O(nlogn) |

B. | O(logn) |

C. | O(n) |

D. | O(1) |

Answer» C. O(n) |

View all MCQs in:
Data Structures (DS)

- 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________.
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
- The worst case complexity of deleting any arbitrary node value element from heap is
- Which of the following is false about a doubly linked list?
- To insert a new node in linked list free node will be available in ___________.
- What differentiates a circular linked list from a normal linked list?
- A ______________ list is a header list where the node points back to the header node.
- What is the best case and worst case complexity of ordered linear search?
- What is the worst case time complexity of LSD radix sort?

Login to Continue

It will take less than 2 minutes

Report MCQ