While working on a project, you determine that you require a collection ADT that imposes a linear ordering on the data items stored within it (but no requirement that the items be in any particular ordering), and that you need to frequently add and remove items from the end of the linear ordering. Which of the following ADTs would service this role most efficiently?

Group of answer choices

Linked m-ary Tree

Arrayed Binary Tree

Singly linked list

Doubly-linked list

None of the other answers meet the stated requirements.

Ordered Binary Tree

AVL Tree

Heap