Implement Stack using two Queues in java

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

In this program, we will see how to implement stack using Linked List in java.
Stack is abstract data type which demonstrates Last in first out (LIFO) behavior. We will implement same behavior using two queue.
There are two most important operations of Stack:
Lets say you have two queues : queue1 , queue2

  • Push : 
    • If queue1 is empty, add elements to queue1
    • If queue1 is not empty, add all elements of queue1 to queue2 , add current element to queue1 and copy all elements of queue2 to queue1.
  • Pop : Simply remove element from queue1.

Java Program:

Lets create a java program to create stack using Linked List.
When you run above program, you will get below output:

Element removed from LinkedList: 75
Removed element : 30
Removed element : 170

That’s all about how to implement Stack using two Queues in java.


import_contacts

You may also like:

Related Posts

  • 23 September

    Sort a Stack using another stack

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post,  we will see how to sort a stack using another stack. Problem Given a Stack,  you need to sort it with the help of temporary stack. Solution : Let’s say,  you have […]

  • 16 September

    Stack implementation in java

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm interview questions. In this post, we will see how to implement Stack using Array in java. Introduction Stack is abstract data type which demonstrates Last in first out (LIFO) behavior. We will implement same behavior using Array. […]

  • 15 September

    Check for balanced parentheses in an expression in java

    If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions. In this post, we will see how to check for balanced parentheses in an expression. Lets say, you have expression as a*(b+c)-(d*e) If you notice, above expression have balanced parentheses. Lets take another expression as (a*(b-c)*(d+e) If […]

  • 10 September

    Implement stack using Linked List in java

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm interview questions. In this program, we will see how to implement stack using Linked List in java. The Stack is an abstract data type that demonstrates Last in first out (LIFO) behavior. We will implement the same […]

Leave a Reply

Your email address will not be published. Required fields are marked *

Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.