stacks.java

queues.java

@@ -0,0 +1,36 @@
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class QueueExample {
+
+	public static void main(String[] args)
+	{
+		Queue<Integer> q
+			= new LinkedList<>();
+
+		// Adds elements {0, 1, 2, 3, 4} to
+		// the queue
+		for (int i = 0; i < 5; i++)
+			q.add(i);
+
+		// Display contents of the queue.
+		System.out.println("Elements of queue "
+						+ q);
+
+		// To remove the head of queue.
+		int removedele = q.remove();
+		System.out.println("removed element-"
+						+ removedele);
+
+		System.out.println(q);
+
+		// To view the head of queue
+		int head = q.peek();
+		System.out.println("head of queue-"
+						+ head);
+
+		int size = q.size();
+		System.out.println("Size of queue-"
+						+ size);
+	}
+}

stacks.java

@@ -0,0 +1,52 @@
+
+import java.io.*; 
+import java.util.*; 
+
+class Test 
+{ 
+	static void stack_push(Stack<Integer> stack) 
+	{ 
+		for(int i = 0; i < 5; i++) 
+		{ 
+			stack.push(i); 
+		} 
+	} 
+	static void stack_pop(Stack<Integer> stack) 
+	{ 
+		System.out.println("Pop Operation:"); 
+
+		for(int i = 0; i < 5; i++) 
+		{ 
+			Integer y = (Integer) stack.pop(); 
+			System.out.println(y); 
+		} 
+	} 
+	static void stack_peek(Stack<Integer> stack) 
+	{ 
+		Integer element = (Integer) stack.peek(); 
+		System.out.println("Element on stack top: " + element); 
+	} 
+
+	static void stack_search(Stack<Integer> stack, int element) 
+	{ 
+		Integer pos = (Integer) stack.search(element); 
+
+		if(pos == -1) 
+			System.out.println("Element not found"); 
+		else
+			System.out.println("Element is found at position: " + pos); 
+	} 
+
+
+	public static void main (String[] args) 
+	{ 
+		Stack<Integer> stack = new Stack<Integer>(); 
+
+		stack_push(stack); 
+		stack_pop(stack); 
+		stack_push(stack); 
+		stack_peek(stack); 
+		stack_search(stack, 2); 
+		stack_search(stack, 6); 
+	} 
+}