Linked List Quiz

In a singly linked list, each node contains:

• Only data

• Data and pointer to the next node

• Data and pointers to next and previous nodes

• Only a reference to the next node

In a doubly linked list, each node has:

• One reference only

• Two references: previous and next

• Three references: previous, next, and head

• No references

In a circular linked list, the link field of the last node contains:

• NULL

• Address of the first node

• Address of the last node itself

• Random address

Main limitation of a singly linked list is:

• Cannot store strings

• Cannot traverse backward

• Cannot insert nodes at all

• Needs more memory than arrays

What Java LinkedList method is used to insert an element at the beginning?

What Java LinkedList method removes the last element?

What will be the output of this code?

LinkedList list = new LinkedList<>();

list.add("Paul"); list.add("John");

list.add("Tina");

System.out.println(list.getFirst());

What is the advantage of a doubly linked list over a singly linked list?

• Less memory usage

• Can traverse in both directions

• Easier implementation

• None of the above

What traversal condition is used in a circular linked list to avoid infinite loop?

In Java LinkedList, what method retrieves but does not remove the last element?