Answer:
Stack,Queue.
Explanation:
In linked list the insertion and removal are not done in constant time we have to traverse the linked list upto that node and insert or remove the node if it not the head worst case will be when we have to insert or delete at the tail.But this is not the case with stacks and queues the insertion and deletion both in stack is at the top and it takes constant time O(1).Where insertion in queue is in the back and deletion is from the front it is also have constant time.
