| 利用堆实现优先队列 |
| |
| 引用本文： | 王兆红.利用堆实现优先队列[J].电脑学习,2005(6):46-47. |
| |
| 作者姓名： | 王兆红 |
| |
| 作者单位： | 山东潍坊学院计算机系 |
| |
| 摘 要： | 利用堆实现的优先队列实质是一棵顺序存储的二叉树。所以具有很好的时间、空间性能。比传统的优先队列具有更广泛的应用前景。可在计算机的各种排队算法中推广应用。
|
| 关 键 词： | 堆 优先队列 二叉树 |
| 收稿时间： | 2005-06-02 |
| 修稿时间： | 2005-06-02 |
Priority Queue Based on Heap |
| |
| Wang Zhaohong.Priority Queue Based on Heap[J].Computer Study,2005(6):46-47. |
| |
| Authors: | Wang Zhaohong |
| |
| Affiliation: | Wang Zhaohong |
| |
| Abstract: | The priority queue based on the heap is a binary tree stored in the sequence area.Compared with the traditional priority queue,it has a better time and space complexity,so it can be used widely and can be embedded in all kinds of sorting algorithm. |
| |
| Keywords: | Heap Priority Queue Binary Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
