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? DS made-easy-test-series data-structures stack + – pranjalgennext asked Jan 19, 2017 • recategorized Mar 6, 2019 by adeebafatima1 pranjalgennext 464 views answer comment Share Follow See 1 comment See all 1 1 comment reply Samujjal Das commented Jan 19, 2017 reply Follow Share Almost same https://gateoverflow.in/2248/gate1997_4-7 1 votes 1 votes Please log in or register to add a comment.