FAQ: Heaps: Python - Min-Heap Review

This community-built FAQ covers the “Min-Heap Review” exercise from the lesson “Heaps: Python”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Computer Science

Complex Data Structures

FAQs on the exercise Min-Heap Review

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Here’s an application for min_heap: a sorting algorithm.

1 Like

Is it okay if I change this part

min = self.heap_list[1]
self.heap_list[1] = self.heap_list[self.count]
self.count -= 1
self.heap_list.pop()
self.heapify_down()
return min

to

min = self.heap_list[1]
self.heap_list[1] = self.heap_list.pop()
self.count -= 1
self.heapify_down()
return min

:woozy_face::woozy_face:

@beowolve, it looks good, since the expressions self.heap_list[self.count] and self.heap_list.pop() appear to do the same thing.

However, it fails when you are down to one element. At that point, the heap looks something like, [None, 10], and the assignment statement

self.heap_list[1] = self.heap_list.pop()

… will return an Index Error, since when an assignment statement is executed, the first thing that happens is that the expression on the right, self.heap_list.pop(), is evaluated. That removes the final item from the list, whose length is reduced from two to one…

When the second part of the assignment takes place, assigning the value returned from the right side to the variable on the left, the interpreter looks for self.heap_list[1] to which to assign the popped value, but it is not there; hence the IndexError.

2 Likes

:open_mouth::open_mouth:
I see~
Thank You!! :star_struck:

1 Like