'Heapify' diaporamas de présentation

Analysis of Algorithms CS 477/677

600 views • 25 slides

removeMin

removeMin. We must take the value from the root node and return it to the user. Then we must remove the node. Easy array implementation: Take the last element in the heap and put it in root Then call heapify!. heapify. i. i. 42. 27. 2i+1. 2i. 2i+1. 2i. 27. 36. 42. 36.

296 views • 17 slides