Multiple Choice
To remove a node with index 0 from a linked list,
A) just move the head reference one node forward
B) set the head reference to null
C) set a reference r to the head of the list,and then set r to null
D) throw an exception,because no list has a node with index 0
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
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
Q4: To remove the first node in a
Q5: A list can be considered a recursive
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