Illustrate all the steps of the adaptable priority queue call remove(e) for entry e storing (16,X) in the heap of Figure 9.1.
Data Structures and Algorithms in Java
6th edition
Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
ISBN: 978-1118771334