Like a regular queue, the priority queue is an abstract data structure that supports adding and removing elements. However, instead of removing the ‘First In’ element, the priority queue removes the element with the highest ‘priority’. But what if in the middle of the program, the priority of an object changes? Indexed Priority Queue gives us the ability to change the priority of an element without having to go through all the elements.