Chapter quiz · Linked Lists

Test what you learned.

8 questions on Linked Lists. Pass 70% to clear the chapter.

← Review chapter lessons

Quiz

Linked Lists — Chapter Quiz

Eight questions on singly/doubly/circular lists, reversal, Floyd's cycle detection, and slow/fast pointers.

0/ 9
  1. Question 1
    1

    What is the time complexity of inserting a node at the head of a singly linked list?

  2. Question 2
    2

    What key advantage does a doubly linked list have over a singly linked list?

  3. Question 3
    3

    When reversing a singly linked list iteratively, which three variables are typically maintained?

  4. Question 4
    4

    Floyd's cycle detection (tortoise and hare) works by:

  5. Question 5
    5

    To find the middle node of a linked list in one pass, you should:

  6. Question 6
    6

    A circular linked list always has a null tail pointer.

  7. Question 7
    7

    When you remove a node from a doubly linked list and you already hold a reference to that node, the operation runs in O(___) time.

  8. Question 8
    8

    Which of the following are situations where a linked list is preferable to a plain JS array? (Select all that apply)

    Select all that apply.

Pick an answer — instant feedback as you go.