07_HeapLab
Implement a heap in C++
Requirements
add
andremove
should be O(log n), except forgrow
which can be O(n)- Do not leak memory
Reading
"Open Data Structures," Chapter 10, just the intro and section 1. http://opendatastructures.org/ods-cpp/10_Heaps.html
Questions
1. Which of the above requirements work, and which do not? For each requirement, write a brief response.
- TODO
- TODO
http://opendatastructures.org/ods-cpp/10_3_Discussion_Exercises.html
2. Exercises 10.1 and 10.2 fromTODO
http://opendatastructures.org/ods-cpp/10_3_Discussion_Exercises.html
3. Exercise 10.4 from4. What is one question that confused you about this exercise, or one piece of advice you would share with students next semester?
TODO