Priority queue stack

Question

How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations?

Edit:- Updated the question clearly

Answer 1

I think you are asking for implementation of stack with the help of priority queue.

Stack is First in Last Out.

So to make priority queue working as a stack , we need priority with the element.

The First element have to be lowest priority , because it will popped out at last from the data structure,

And the last element should have highest priority becayse it have to popped out first.

So Lets take first element have priority 1 , second element 2  and so on.....

This will make our priority queue work as stack.

As priority queue  required log(N) cost in case of Enqueue( push opeation ) and Dequeue( pop operation )

Further complexity of push operation can be reduced to constant, as in case of Fibonacci heap data structure , if our priority heap was implemented by Fibonacci heap , then Enqueu in O(1) and Dequeu in Log(N).