Heap Make Byline with airSlate SignNow

Heap create signatory

welcome to our 15th video with data structures and algorithms and in the last video we talked about uh how to do a max heapify and in this video we're going to talk about how to actually do build heap and how we're going to actually implement a heap because last time we did we just had this arbitrary tree you know this binary tree with a bunch of nodes in it and then we called max heapify on that and built a max heap of max heap out of that or turned that into a max heap now we're going to use an array right to store a heap and um it's easy for us to do that right we don't need to actually do like a linked kind of a list right where we have uh like pointers because this actually that when we draw these trees it kind of looks like we have you know pointers right to these other elements visually we kind of it's easier to think of it that way but we can use an array which is a little bit more efficient right we don't have to worry about that stuff so how do we build a heap out of this array well i've marked all these nodes okay we've got eight elements in our array so we've got eight nodes and i've marked each one now we have to keep uh the nearly complete property of a build heap so if we just number these from top to bottom left to right okay one two three four five six seven eight we keep that property right so there's our first thing and all we have to do is insert these elements right i'm not really inserting them but in our visual diagram here we're just going to write these elements here right so we've got 5 and then 12 and then 64. right we're just going along left to right right 1 37 90 91 and 97 and now here's our little algorithm right so we're ready to actually build heap all right so we take this right from length of a the last one last element and we divide that by two and then we max heapify from there and as we said in the last video we start from the last subtree which is here right just happens to have one child element and then we go to this one right one less right four minus one minus one minus one right and we heapify we max heapify each one of these subtrees okay so that's what we're going to do so i equals eight divided by two floor so i is here okay and we max heapify and as we said before we take the larger of the two child elements and we swap with the parent okay that's if the parent is of course less than or equal to the children so in this case we've got to...