Heap Clean Up Signatory with airSlate SignNow

Heap clean up signatory

hey everybody this is Paul welcome to part two in introduction to a heap data structure so for this example I'm going to be removing an item from a heap so I've got a max heap here and once again a max heap is a heap where all the parent nodes are greater than the children nodes so you can see that's the case all the way down the list each parent is greater than its children and basically what we're going to do is I'm going to remove the item from the root since that's the most commonly implemented method when we're removing an item from a heap you could remove it anywhere if you really wanted to but since programs usually like to remove them from the top because that's kind of how priority queues work I'm going to show you that method so let's say that we go ahead and remove the 40 from our route here and basically what we're going to do is we're just going to take that 40 and our program is just going to use it over there to do whatever it needs to and then the next thing we need to do is we need to make sure that we keep the right structure for our heap we need to make sure it's full from top to bottom left to right and so to keep that property we need to take this node right here or this leaf and move it up to the root so now that we've deleted that leaf or that node depending on how you want to think about it we basically have the right structure for a heap but now we do not have the right properties for our max heap now we have eight which is less than 18 it's less than 20 and our route is supposed to be the biggest number so in order to fix that to make this back into a heap again we basically look at the two children of the root here and we compare the two and we figure out which one is the biggest so it turns out 20 is bigger than 18 now that we have that established we compare 20 with the value 8 and if 20 is bigger than 8 then we simply switch the two numbers the child is bigger than the parent then we switch them so we're just going to put 20 where 8 is and 8 where 20 is and so then we check once again we checked the two children of this guy right here and so we're going to compare nine and nineteen nineteen is bigger then we check is nineteen less than eight nope it's not so we move nineteen up to where eight is and we put eight where nineteen is we just flip the two and so now we have once again our max-heap so now if we wanted to remove another item from the...