堆積（heap）是樹結構的第三種型態。堆積是一棵二元樹，其左右子樹節點的值均較其父母節點的值小。堆積的根節點值保證是該樹最大值。這中堆績稱為最大堆績。堆積的子樹可擺在左邊當左子樹，也可擺在右邊當右子樹，因此左右子樹俱有相同的性質。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of th

二叉堆的操作。包括最大堆和最小堆的建立与调整。-Binary heap operations. Including the largest heap and the establishment and adjustment of the minimum heap.