The best programmers are not marginally better than merely good ones. They are an order-of-magnitude better, measured by whatever standard: conceptual creativity, speed, ingenuity of design, or problem-solving ability. Randall E. Stross

Queue Using Stack

Language Java | Level Intermediate | Category Data structure | August 30, 2015 5:07 pm

Data structure Description

A queue can be implemented using two stacks. The queue supports enqueue and dequeue operations using head and tail nodes.

Write a program to implement the queue using two stacks.


Enqueue itmes to the queue: [hello, kid, test]
Size of the Queue: 3
Items in the Queue: [hello, kid, test]
Dequeue itme from queue: hello
Dequeue itme from queue: kid
Items in the Queue: [test]



No comments available!

Please login to add comments.