Multiple Choice
To remove a node X with index 1 or greater from a linked list,
A) set a reference pred to the predecessor of the node you want to remove,and set the successor of pred to the successor of X
B) decrease the index of the node to be removed by 1,and then set its reference to null
C) first store the value of the element in X in a safe place,then set its reference to null
D) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Q12: In Java,the first node in a list
Q13: In a typical circular doubly linked list,a
Q14: A linked list class uses a Node
Q15: A linked list class uses a Node
Q16: In a linked list implementation using a
Q18: A method int size( )in a linked
Q19: A circularly linked list makes it easy
Q20: A Node class for a linked list
Q21: A recursive computation of the size of
Q22: In a typical doubly linked list,a node