【单选题】If the most commonly used operations are to visit a random position and to insert and delete the last element in a linear list, then which of the following data structures is the most efficient?
A.
doubly linked list
B.
singly linked circular list
C.
doubly linked circular list with a dummy head node