Activity: Heaps

Learning Objectives:

• Understand array representations of binary trees
• Convert a binary tree diagram to an array representation
• Perform heap operations (insert, remove)
• Analyze the time complexity of priority queue operations with different implementations

To Receive Credit: attendance or Canvas submission (with pre-arranged absence)

Instructions

Complete the following worksheet:

• Heaps Worksheet

Recommended: Work with a partner to complete the worksheet.