Discuss how to apply queue using stack
Discuss how to apply queue using stack?
Expert
A queue can be applied by using two stacks:-
• 1. An element is inserted in queue by pushing it in stack 1 • 2. An element is extracted from queue by popping it from stack 2 • 3. If stack 2 is empty then all elements currently in stack 1 is transferred to stack 2 however in the reverse order • 4. If the stack 2 is not empty just pop value from stack 2.
Illustrates about a linear and non linear data structure?
What is the application of tree data-structure?
What do you mean by Huffman algorithm?
What do you mean by recursive algorithm? Describe in brief.
What is win-win spiral model?
Describes the bubble sort algorithm?
What is the way to implement of deletion from a binary tree?
Elucidate the terms Run-Time Stack, Binding Time, Recursive case, Base case and Tail Recursion?
Define the pre-order and in-order tree traversal.
Minimum number of queues required implements the priority queue?
18,76,764
1924137 Asked
3,689
Active Tutors
1452303
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!