Discuss how to implement queue using stack.
No Answer is Posted For this Question
Be the First to Post Answer
What is the use of tree data structure?
What is a height of a tree?
Which is the parent class of enumset class?
Give one example of right rotation.
What is the best case complexity of bubble sort?
What is time complexity of binary search?
Why is merge sort faster?
How many different trees are possible with 10 nodes ?
What is the structure of an array?
What is stable sort?
What are the drawbacks of array implementation of queue?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].