Hi Nishant
As per the question, (priority queue) PQ is used to implement stack. With
PQ, you cannot do push and pop both in O(1). If you use heap tree(max heap
assuming you increase priority for upcoming pushed objects or min-heap
otherwise) for PQ, it will take O(log n) for each operation
@Ankur... what ever we are inserting we are inserting at the head of the
list, so its O(1).
we are overriding Enque method with Push().
On Sun, May 26, 2013 at 10:15 AM, Ankur Khurana ankur.kkhur...@gmail.comwrote:
but in this approach , How is Push having O(1) complexity ?
On 25 May 2013
I am not getting the y priority Q is getting used for this question, as in
case of P Queue, things are arranged as per the priority so when we will
insert the data we can simply increament the priority.
Algo would be like this :
Enque(q, data) {
push(q, data, increrase the prioroty);
}
int
you are doing it correct.
On Sat, May 25, 2013 at 5:37 PM, Nishant Pandey
nishant.bits.me...@gmail.com wrote:
I am not getting the y priority Q is getting used for this question, as in
case of P Queue, things are arranged as per the priority so when we will
insert the data we can simply
but in this approach , How is Push having O(1) complexity ?
On 25 May 2013 17:52, rohit jangid rohit.nsi...@gmail.com wrote:
you are doing it correct.
On Sat, May 25, 2013 at 5:37 PM, Nishant Pandey
nishant.bits.me...@gmail.com wrote:
I am not getting the y priority Q is getting used
