二项堆数据结构分析和基本操作的实现  

Analysis of Binomial Heap Data Structure and Implementation of Basic Operation

作　　者：胡新海[1] HU Xin-hai(School of Mathematics and Information,Longnan Teachers College,Chengxian Gansu 742500)

机构地区：[1]陇南师范高等专科学校数信学院,甘肃成县742500

出　　处：《甘肃高师学报》2020年第5期16-18,共3页Journal of Gansu Normal Colleges

摘　　要：二项堆是数据结构中的基本结构,在设计开发中有着广泛的应用.在对二项堆的定义、节点结构以及实现二项堆几类基本操作理解的基础上,分析了数据结构的性质和特点.Binomial heap is a basic structure in data structure,and has a wide range of applications in design and development.In this paper,the properties and characteristics of data structure are analyzed on the basis of a further understanding of its definition,node structure,and implementation of several basic operations of the binomial heap.

关 键 词：二项堆 节点定义 复杂度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]