data structures with location-aware entries is summarized in table table running times of the methods of an adaptable priority queue of size nrealized by means of an unsorted listsorted listand heaprespectively the space requirement is (nmethod unsorted list sorted list heap sizeisempty ( ( ( insert ( (no(lognmin (no( ( removemin (no( (logn