It might be helpful to think of real-world examples to remember them at first.
For a stack, think of a physical stack of books. It is added-to by placing another one on top (push) and to remove one you have to take the top one first (pop).
For a queue, think of a print queue. If someone prints a document first, their document will be printed first.
For linked lists, think of the links (nodes) in a chain. There is a beginning (root node) and each link only connects to the next adjacent one.
i believe binary search works with array and continuously dividing the index by two until it finds what you're trying to search.. linked list is like a train.. one part only care or points whats in front or behind of it.. in other words linked list don't use index..
In computer science, a binary search is an algorithm for locating the position of an element in a sorted list. It inspects the middle element of the sorted list...
You can't get to the middle of a linked list in an efficient way