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.
Write down a brief note on the term Huffman algorithm?
Specify the actions which are performed when a function is called?
How is different type of element insert in a stack? Is it possible?
Minimum number of queues required implements the priority queue?
What are the differences between data structure of System R and the relational structure?
Explain the disadvantages of the array implementations of linked list?
Illustrate the term algorithm. Write down some of the properties of an algorithm?
Write down in brief the working process of Quick sort?
Define the term threaded binary tree. Describe its common uses.
Write down the difference between BFS and DFS?
18,76,764
1947709 Asked
3,689
Active Tutors
1440578
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!