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.
Describe the Quick sort algorithm.
What are the applications in which stacks are used?
Explain when AVL tree property is violated and describe how to solve it?
Explain the case tools?
Describe in brief the term Fibonacci Search?
Briefly describe the term priority queues?
What are the differences between data structure of System R and the relational structure?
How Armstrong rules are complete sound?
Explain what is meant by the specification?
Briefly describe the term Bubble Sort and Quick sort?
18,76,764
1932938 Asked
3,689
Active Tutors
1453316
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!