1.

A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q)(Q). For a sequence of operations, the keys chosen are in

A. Non-increasing order
B. Non-decreasing order
C. Strictly increasing order
D. Strictly decreasing order
Answer» E.


Discussion

No Comment Found