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 any two merits using single linked list over the doubly linked list and vice-versa?
What is the application of tree data-structure?
Is it probable to insert dissimilar type of elements in stack?
When should we use Space in linked list instead of an array or vice versa?
What are the uses of binary tree?
What do you mean by Huffman algorithm?
Minimum number of queues required implements the priority queue?
Explain the disadvantages of the array implementations of linked list?
Define the use of Direct Access in linked list instead of an array or vice versa.
What is known by the verification and validation?
18,76,764
1933181 Asked
3,689
Active Tutors
1421237
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!