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.
What are the applications in which stacks are used?
In a linked list how can I search for data?
Write down the prerequisites for implementing the queue ADT by using array?
comparison between singly linked lists and doubly linked lists
Explain how can I search for data in the linked list?
Illustrate the term algorithm. Write down some of the properties of an algorithm?
Describes the uses of Tree Database?
What are the uses of binary tree?
Describe the terms Base case, Binding Time, Recursive case, Run-Time Stack and Tail Recursion.
Define the term process?
18,76,764
1954464 Asked
3,689
Active Tutors
1424108
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!