☑Kizspy.me
(Choose 1 answer)
☐ A
Back
Next
What does the following algorithm do?
Algorithm add last(L,e):
newest Node(e)
newest.next = None
L.tail.next newest
L.tail newest
A. Inserting a new node at the end of a singly linked list.
B. Inserting a new node at the head of a singly linked list.
C. Removing a node at the end of a singly linked list.
D. Removing a node at the head of a singly linked list.
FUQ.sh
sh the exam.
