Understanding Linked Lists

Fill in the Blank: Fill in the blank with the correct words. A linked list is composed of elements called _____________. Word bank: next, null, previous, addFirst, nodes.

• nodes

• next

• null

• previous

Fill in the Blank: Fill in the blank with the correct words. Each node in a linked list contains an element and a _____________ to the next node. Word bank: next, null, previous, addFirst, nodes.

• pointer

• next

• null

• previous

Fill in the Blank: Fill in the blank with the correct words. The reference to the last node in a linked list is often a _____________ reference. Word bank: next, null, previous, addFirst, nodes.

• null

• next

• previous

• addFirst

Adding a new node to the beginning of a singly linked list uses the _____________ method.

• addFirst

• addLast

• insertAfter

• removeFirst

Fill in the blank with the correct words. In a doubly-linked list, each node has references to both the next and _____________ nodes.

• previous

• next

• first

• last

What is a primary advantage of using a linked list over an array?

• Faster random access

• Memory conservation

• Easier to implement

• Always faster operations

Which of the following best describes a doubly-linked list?

• A) Each node has a reference to the next node only

• B) Each node has references to both the next and previous nodes

• C) It is a static data structure

• D) It cannot be traversed in reverse

What is the method used to retrieve the value stored in a ListNode?

• getValue()

• getNode()

• retrieveValue()

• fetchValue()

In traversing a linked list, what happens when the end of the list is reached?

• The program throws an exception

• The traversal stops when the reference is null

• The program loops back to the start

• The last node is printed twice

What is the main disadvantage of a linked list?

• It requires more memory per element

• It is not dynamic

• It is difficult to add elements

• It cannot store objects