Singly and Doubly Linked List Quiz

Which line correctly defines a Node in a singly linked list?

class Node {

int data;

Node next;

Node(int d) {

_______________; // ← Fill this}}

• this.next = d;

• data = d; next = null;

• this.data = next;

• data = next;

What should go in the blank?

void insertAtHead(int data) {

Node newNode = new Node(data);

newNode.next = ___________; // ← Fill this

head = newNode;}

• null

• head

• newNode

• head.next

Choose the correct loop:

Node temp = head;

while (__________) {

System.out.print(temp.data + " ");

temp = temp.next;}

• temp != null

• head != null

• temp.next != null

• temp.data != 0

Which line correctly moves to the second-last node?Node temp = head;

while (temp.next.__________) {

temp = temp.next;}

• next != null

• next == null

• next.next != null

• data != null

(Double)Which is correct?class DNode {

int data;

DNode next, prev;

DNode(int d) {

data = d;

next = null;

_________; // ← Fill }}

• prev = d;

• prev = null;

• d = prev;

• prev = next;

Which line completes the logic?(Double)

DNode newNode = new DNode(data);

newNode.next = head;

if (head != null)

head.__________ = newNode;

head = newNode;

• next

• prev

• data

• pointer

Complete the code to print the list in reverse:(double)

DNode temp = tail;

while (temp != null) {

System.out.print(temp.data + " ");

temp = ___________;

}

• temp.next

• temp.prev

• head.prev

• temp.back

Which line correctly checks if there's only one node?

if (head != null && head.___________ == null) {

// single node case

}

• data

• next

• next.next

• prev

Fill in the logic:(Double)

DNode newNode = new DNode(data);

DNode temp = head;

while (temp.next != null) {

temp = temp.next;}

temp.next = newNode;

newNode.__________ = temp;

• data

• prev

• next

• node

When deleting from an empty singly list, which check is safest?

if (__________) {

System.out.println("List is empty");

return;}

• head == null

• head.next == null

• head.data == 0

• head != head