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.
Define the Armstrong rules.
Is it probable to insert dissimilar type of elements in stack?
Define the term Arrays in brief?
Illustrates about a linear and non linear data structure?
Briefly describe the term Tree database. Elucidate its common uses?
Explain binary tree?
Explain the difference between a stack and a Queue.
What is the quickest sorting method to use?
Briefly describe the term Bubble Sort and Quick sort?
Does the minimum spanning tree of graph provide the shortest distance between any two specified nodes?
18,76,764
1926420 Asked
3,689
Active Tutors
1421379
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!