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 is Quick Sort?
What does isEmpty() member technique determines?
Write down the differentiation between NULL AND VOID pointers?
Write down a brief note on the term iterative algorithm?
Write about queue?
What is the way to implement of traversal of a binary tree?
Briefly explain the term binary tree? Elucidate its uses?
Explain the user interface design?
Define software engineering?
Run Time Memory Allocation is termed as?
18,76,764
1951961 Asked
3,689
Active Tutors
1450571
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!