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 the various types of algorithms?
Explain about the priority queue?
What is the data structures employed to carry out recursion?
Define does the minimum spanning tree of a graph provide the shortest distance among any two given nodes.
Specify the actions which are performed when a function is called?
Briefly describe the term sequential search? And also write down the average number of comparisons in a sequential search?
Define the term Linear and non-linear data structure.
Explain binary tree?
How is different type of element insert in a stack? Is it possible?
Elucidate the terms Run-Time Stack, Binding Time, Recursive case, Base case and Tail Recursion?
18,76,764
1935620 Asked
3,689
Active Tutors
1419667
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!