(self, alist)
| 47 | return retval |
| 48 | |
| 49 | def buildHeap(self, alist): |
| 50 | i = len(alist) // 2 |
| 51 | self.currentSize = len(alist) |
| 52 | self.heapList = [0] + alist[:] |
| 53 | while (i > 0): |
| 54 | self.percDown(i) |
| 55 | i = i - 1 |
| 56 | return self.heapList |
| 57 | |
| 58 | H = BinHeap() |
| 59 | print(H.buildHeap([9, 6, 5, 2, 3])) |