| 左倾堆枚举计数递推公式及实现 |
| |
| 引用本文： | 李言刚,孙强.左倾堆枚举计数递推公式及实现[J].计算机工程,2010,36(20):64-65. |
| |
| 作者姓名： | 李言刚 孙强 |
| |
| 作者单位： | 华东师范大学计算机科学与技术系,上海,200241 |
| |
| 摘 要： | 通过对左倾堆性质和定理的深入研究，用组合的方法推导出含n个不同节点的左倾堆的枚举计数的递推公式，并用程序进行实现和验证，给出相应的实验结果，从而为非完全二叉树型的堆结构的枚举计数提供借鉴和参考，同时也为左倾堆枚举生成和随机生成以及左倾堆的平均算法复杂性的分析奠定基础。
|
| 关 键 词： | 左倾堆 枚举 计数 组合 递推公式 |
Recursive Formula for Leftist Heap Enumeration Counting and Its Implementation |
| |
| LI Yan-gang,SUN Qiang.Recursive Formula for Leftist Heap Enumeration Counting and Its Implementation[J].Computer Engineering,2010,36(20):64-65. |
| |
| Authors: | LI Yan-gang SUN Qiang |
| |
| Affiliation: | (Dept. of Computer Science and Technology, East China Normal University, Shanghai 200241, China) |
| |
| Abstract: | A recursive formula of enumeration number of leftist heap with n different nodes is put forward using the combination method based on the definition,facts and theorems of leftist heap.An algorithm on this formula is also given in this paper and is verified by a program.The work of this paper can provide some reference for n binary tree enumeration that is not a complete tree as well as can provide a foundation for leftist heap’s enumeration generating,random generating and average complexity analysis. |
| |
| Keywords: | leftist heap enumeration counting combination recursive formula |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
