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.
Illustrates the recursive algorithm?
Describe the term binary tree? Describe its some uses.
What are the differences between Base case and Run-Time Stack?
Explain the way of searching for data in a linked list.
How is different type of element insert in a stack? Is it possible?
How Armstrong rules are complete sound?
Briefly describe the term stack operation?
Define software engineering?
What is meant by the debugging?
Define cohension and coupling?
18,76,764
1943718 Asked
3,689
Active Tutors
1420241
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!