Register

MadeEasy Subject Test: Programming & DS - Stack

• recategorized by
639 views
0 0 votes

A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operations, the keys chosen are in Strictly decreasing order. How?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · CN. subnetNext → · doubt
← Previous in category · Virtual Gate Test Se...Next in category → · number of BST
Position:
Show:

Related questions

2 2 votes
0 0 answers
826
826 views
CHïntän ÞäTël asked Dec 7, 2018
826 views
MadeEasy Subject Test 2019: Programming & DS - Stack
I THING THERE IS MISTAKE BECAUSE BRACKET ARE CLOSING AFTER ELEMENT E SO ALL OPERATORS HOULD BE POPED AND AND ACCORDING TO ME ANWER SHOLD BE 2…TRY AND CORRECT IF I M WRON...
2 2 votes
1 1 answer
2.7k
2.7k views
Gupta731 asked Dec 7, 2018
2,679 views
MadeEasy Test Series: Programming & DS - Stack
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown.The number of elements that will remain in the stack a...
2 2 votes
2 2 answers
3.1k
3.1k views
jatin khachane 1 asked Dec 1, 2018
3,076 views
MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
10 10 votes
0 0 answers
2.1k
2.1k views
MiNiPanda asked Jan 25, 2018
2,118 views
MadeEasy Test Series 2018: Programming & DS - Stack
Given finite alphabet S = {A, B, C} and stack S of size 100. There are only three stack operations we can perform as mentioned below.Stack is initially empty and we do no...