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 main uses of data structures?
Explain about a B+ tree and its uses.
Write down in brief the working process of Quick sort?
What is a Fibonacci Search?
Briefly describe the term priority queues?
Write down the major data structures employed in the following areas: RDBMS, Network data model and Hierarchical data model?
Explain about the term database Trigger.
Elucidate any two merits using Single linked list over doubly linked list and vice-versa?
Define the fastest sorting method to use?
Explain about the threaded binary tree and its common uses.
18,76,764
1922463 Asked
3,689
Active Tutors
1456305
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!