摘要
对基于二叉树的高级数据结构———堆展开了讨论,介绍了堆的基本性质及堆的基本操作筛运算,分析了堆的高效的特点。最后通过一个例子进一步深入地介绍了堆在解题中的灵活的运用方法,并将堆与其他数据结构相比较,体现了堆的高效的特点。
Advabced data structures is a good tool to optimize the algorithm.In this paper,the basic element of the advanced data structure,Heap is argured.At first the basic property of heap and the basic operation on heap, the sedge operation are introduced. The operation is very efficient as it takes O(log_2 n) time. From this point,a kind of sorting algorithm on heap, the heap sorting is drawn. To improve skill to use this data algorithm to optimize algorithm, an example to use heap to optimize algorithm is given. In the example, comparison of the heap in the table shows the heap much more efficient.
出处
《南京工业大学学报（自然科学版）》
CAS
2004年第3期71-74,共4页
Journal of Nanjing Tech University(Natural Science Edition)
关键词
数据结构
堆
二叉树
算法优化
advanced data structures
optimize the algorithm
heap
binary tree
