Register

MadeEasy Subject Test: Programming & DS - Stack

• recategorized by
457 views
0 votes
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?

• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
1
CHïntän ÞäTël asked Dec 7, 2018
452 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 WRONG !!!! THANKS IN ADVANCE!!!
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 WR...
User Avatar
2 votes
2 votes
2 answers
3
jatin khachane 1 asked Dec 1, 2018
1,266 views
MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
User Avatar
Link Copied!