Which statement is false?
A. Insertions and deletions are made only at one end of a queue, its tail.
B. Linked lists are collections of data items "lined up in a row"-- insertions and deletions can be made anywhere in a linked list.
C. Binary trees facilitate high-speed searching and sorting of data.
D. Insertions and deletions are made only at one end of a stack, its top.

In the Queue, there are two ends. one end is used to data insertion(enqueue) and other end-use to data deletion(dequeue). It follows the FIFO methodology that means first in first out. and all option are correct that can be described as:

In option B, the linked list is also known as a leaner data structure. In linked list data is not stored in contiguous memory. It contains nodes in each node there are 2 parts/block. First block for element and the another block for the reference. In the linked list we insert or delete elements anywhere on the list.
In option C, the binary tree is that whose elements have more than 2 children or nodes. In the binary tree, it provides a high-speed searching and sorting for data.
In option D, stack follows the LIFO methodology that means last in first out. In the stack, there is only one end. So, insertion and deletion of the data is performed only on end that is its top.

That's why the answer to this question is the option "A".