摘要： 给出了一个最大值堆（当它为一棵满二叉树时）的枚举计数公式，提出了计算任意一个最大值堆的枚举总数目的一个实用算法。

关键词: 最大值堆, 枚举, 数目, 公式, 算法

Abstract: An enumeration counting formula of the max-heap (when it is a full binary tree) is put forward and the formula uis proved in this paper. Moreover, a practical algorithm of calculating the enumeration number of any max-heap is given in this paper.

中图分类号: 

• TP301.6