Description: There is a hypothesis that the left subtree and the right subtree of the node with the subscript of I in the array are the heaps that maintain the maximum heap properties. On the premise of assumption, the heap that has been maintained through this maintenance function can be guaranteed to be the largest heap.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| heap.cpp | 1280 | 2018-03-20
|
| __MACOSX | 0 | 2018-03-20
|
| __MACOSX\._heap.cpp | 210 | 2018-03-20 |
Download