Feedback on heaps, priority queues, and integer sorting algorithms

[Anisha7]

Great work on completing these challenges. Here's some feedback to improve your code:

• Your delete_min() function seems to not be getting the min item in the heap. Use print statements to see where the issue could be, and reach out if you need help debugging!
• It looks like your priority queue does not take priority into account when inserting. How can you update your enqueue method to take this in account? Also, your priority queue's methods are trying to access a size property that does not exist. Did you mean to use length()?
• Your counting sort fails tests. Try running pytest sorting_test.py::IntegerSortTest to see what errors you get and reach out if you need help debugging.