Double Ended Priority Queue is implemented using Interval Heaps. My double ended priority queue is of the form [['abc',xyz'],['c'.'t'],['f','n']]; so here minimum is 'abc' and maximum is 'xyz'. Heap is represented as list.
Asked
Active
Viewed 58 times
0
-
it's possible to do anything that can be done in python without importing anything – danidee Sep 05 '16 at 12:49
-
what I mean is if you are suggesting a way, suggest it without any libraries. – Fenil Fadadu Sep 05 '16 at 16:47