Data Structure

Data Structure Linked Lists

‹ Previous Next › Start Quiz - Linked Lists

⚠ Report ✓ Question Verified Copy Link

Q: What is the time complexity of deleting an element from a singly linked list?  

‹ Previous Next ›
Write your comment

Q 1: Which of the following is true about a doubly linked list?

  • A It can only be traversed in one direction.
  • BIt cannot be circular.
  • CIt has better cache locality than a singly linked list.
  • DIt can be traversed in both directions.

Q 2: What is the time complexity of deleting an element from a singly linked list?

  • AO(1)
  • BO(n)
  • CO(log n)
  • DO(n log n)

Q 3: Which of the following is NOT a common application of linked lists?

  • AImplementing a queue or stack
  • BImplementing a graph
  • CImplementing a hash table
  • DImplementing a string

Learn More MCQ Questions from Data Structure Linked Lists