Stack vs Queue Methods in Java
Method Queue Methods Stack Methods
add(E e) / offer(E e) add(E e) / offer(E e) push(E e)
remove() / poll() remove() / poll() pop()
peek() / element() peek() / element() peek()
isEmpty() isEmpty() isEmpty()
size() size() size()
Queue Example:
---------------
import java.util.Queue;
import java.util.LinkedList;
public class QueueExample {
public static void main(String[] args) {
Queue<String> queue = new LinkedList<>();
queue.add("Apple");
queue.add("Banana");
System.out.println("Queue size: " + queue.size()); // Output: 2
System.out.println("Head: " + queue.peek()); // Output: Apple
System.out.println("Removed: " + queue.remove()); // Output: Apple
System.out.println("Is queue empty? " + queue.isEmpty()); // Output: false
Stack Example:
--------------
import java.util.Stack;
public class StackExample {
public static void main(String[] args) {
Stack<String> stack = new Stack<>();
stack.push("Apple");
stack.push("Banana");
System.out.println("Stack size: " + stack.size()); // Output: 2
System.out.println("Top: " + stack.peek()); // Output: Banana
System.out.println("Popped: " + stack.pop()); // Output: Banana
System.out.println("Is stack empty? " + stack.isEmpty()); // Output: false