3. Priority Queue

Insert

• Check element against root
• Swap up until you can’t anymore

Remove

• Copy first element
• Replace first element with last
• Compare element with both children
• Swap element with largest child and repeat until no child is larger anymore.