Question

Linked lists are collections of data items "lined up in a row"-- insertions and deletions can be made anywhere in:________

a. linked list.
b. Insertions and deletions are made only at one end of a stack, its top.
c. Insertions and deletions are made only at one end of a queue, its tail.
d. Binary trees facilitate high-speed searching and sorting of data.

Answer 1

a. linked list

Step-by-step explanation:

a b c are all correct statements..... but

insertions and deletions can happen anywhere in a linked list. Not Stack, Not Queue.