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.
Explain about the threaded binary tree and its common uses.
Define the term process?
What is the application of tree data-structure?
Explain about Arrays.
What are the applications in which stacks are used?
What is meant by the double linked list?
Explain about a matrix and its uses with an example.
What do you mean by Huffman algorithm?
Write about queue?
Write down the differentiation between a stack and a Queue?
18,76,764
1933334 Asked
3,689
Active Tutors
1435083
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!