Multiple Choice
To remove the first node in a nonempty linked list,
A) move the successor reference in the head node one node forward:
Head.next = head.next.next;
B) set a reference pred to the predecessor of the node you want to remove,and set the successor of pred to the successor of the head
C) move the head reference one node forward:
Head = head.next;
D) delete the node by setting the head reference to null:
Head = null;
Correct Answer:

Verified
Correct Answer:
Verified
Q1: A list method void add(int index,E x)seeking
Q2: To allocate storage for their elements,linked lists
Q3: The tail of a list<br>A) is an
Q5: A list can be considered a recursive
Q6: To remove a node with index 0
Q7: Scientists in a certain laboratory are working
Q8: In many recursive operations on lists,<br>A) the
Q9: A list method E remove(int index)designed to
Q10: A list in which each stored element
Q11: A linked list class uses a Node