Implementation of queue using stack
Describe the process how to implement the queue by using stack.
Expert
The queue can be implemented by using two stacks as:
a) The element is inserted in the queue by pushing it into the stack 1.
b) Element is extracted from the queue by popping it from the stack 2.
c) If the stack 2 is empty then all the elements presently in stack 1 are transferred to stack 2 however in the reverse order.
d) If the stack 2 is not empty simply pop the value from the stack 2.
A Linked List Instead Of an Array When Should You Use?
Give a brief description of the term Merge Sort?
Define the fastest sorting method to use?
State the difference between the Stack and Array?
What is known as error tracking?
Write down a brief note on the term Huffman algorithm?
Describe the term two-dimensional array by using example?
Write down the demerits of circular linked list over linear linked list?
What is minimum number of queues required to implementing the priority queue?
What are the categories of software?
18,76,764
1957694 Asked
3,689
Active Tutors
1457232
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!