{"content":[{"text":"Priority Queues","bbox":{"left":0.06,"top":0.074332,"width":0.409216,"height":0.099781}},{"text":"• Collection of elements each of which has a priority. \n • Does not maintain a first-in, first-out discipline \n • Elements are retrieved according to their priority. \n • New items can be inserted in any order. \n • Whenever an item is removed, that item has highest priority. \n • Customary to give low values to high priorities \n • 1 denotes the highest priority \n • Priority Queue extracts the minimum element from the \n queue.","bbox":{"left":0.0725,"top":0.2415,"width":0.779919,"height":0.5012970000000001}}],"images_bbox":[],"images_bbox_not_text_overlap":[]}