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 heap operations with different implementations
Time to Complete: 30-40 minutes
To Receive Credit: attendance or Canvas submission
Instructions
Complete the following worksheet:
Recommended: Work with a partner to complete the worksheet.
Solutions
- Solutions will be posted on Canvas.
Submission
You will receive credit based on attendance. Alternatively, you can submit a legible scan to Canvas for credit.