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 Tree database briefly.
What are the uses of binary tree?
Give a brief description of the term Merge Sort?
What do you mean by sequential search? Find out the average number of comparisons in the sequential search?
Write down the differentiation between STACK and ARRAY?
Give a small description of the term Arrays?
By using a declaration statement how is memory reserved?
Describe the terms Base case, Binding Time, Recursive case, Run-Time Stack and Tail Recursion.
What are the applications in which stacks are used?
What are the applications where stacks are used?
18,76,764
1937267 Asked
3,689
Active Tutors
1445955
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!