堆积（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 their parents the value of small nodes. Accumulation are the root of the tree to ensure that the value of Maximum. This is known as the greatest performance in the reactor performance heap. Accumulation of sub-tree can be placed at the left when the left subtree can also be placed on the right when the right subtree, so there is about the same subtree of the nature of both.