Geeks for Geeks has a more complete article about how to use the LinkedList Collection
LinkedList<String> object = new LinkedList<String>();
object.add("A");
object.remove("A");
object.removeFirst();
object.removeLast();
boolean status = object.contains("E");
See the example code on the left and the Geeks for Geeks article for more member methods.
Picture from JavaTPoint
This website to the right does a better job explaining vectors than I can. Sorry it's embedded and there's a few ads, but you know, we wouldn't be able to grab this information if it wasn't funded.
Journaldev has a great article on stacks including not only the usage, but a simplified explanation about how the stack.push() and stack.pop() operations work internally.
Create a stack by saying Stack<Integer> urNameOfStack= new Stack<Integer>();
Last-in, First-out. LIFO.
Methods
boolean empty(); //Checks if the list is empty.
E peek(); //Checks the top of the stack, but doesn't remove anything.
E pop(); //Removes and returns the item at the top of the stack.
E push(); //Places an item at the top fo the stack.
int search(Object o); //Returns the index of where that object is on the stack.
Queue<Integer> mikeChaseQueue = new LinkedList<>();
Add an element to the queue: mikeChaseQueue.add(1);
Remove an element from the queue: mikeChaseQueue.remove();
Return the head of the queue: mikeChaseQueue.peek();
Return the size of the queue: int size = mikeChaseQueue.size();
The Deque interface is like the Queue, but you can access both sides of the queue, meaning you can add or remove elements from either end of the data structure.
It can be used as a Queue or Stack
LIFO and FIFO.
Deque<String> mikeChaseDeque= new LinkedList<String>();
Add to the tail: mikeChaseDeque.add("Adding myself to the tail!");
Adding to the head: mikeChaseDeque.addFirst("Adding Myself to the Head!");
Removing from the head: mikeChaseDeque.removeFirst();
Removing from the tail: mikeChaseDeque.removeLast();