摘要
发现并证明了最大堆的一种性质，即：某一层上的所有结点的值（不包括叶子结点的值）与堆中此层以下的所有结点的值满足一个不等式组。
In this paper, a property of the heap has been discovered and proved. A group of inequalities must be satisfied between these keys in one hierarchy (except the keys of leaf nodes) and those keys in higher hierarchies of a heap.
出处
《计算机工程》
CAS
CSCD
北大核心
2001年第6期100-101,共2页
Computer Engineering
