搜索资源列表
assign5
- 利用heap实现三叉树的组建，插入，排序。 分析推导 算法的时间复杂度。 - create a max heap class that is based on a complete ternary tree. As with a complete binary tree max heap, the largest value is at the root and the root is at location 1 in the vector holding the heap. L
Heaps
- a heap class + program wriitten in c++. it implements a max heap
max_heap_test
- the c source code of max heap
priority-queue
- 使用循环队列创建最小和最大优先队列，并使用堆排序方法去排序。-Using the circular queue to create the min and max priority queue, and using heap sort method to sort the queue.
Max-heap
- 利用C++编程语言解决数据结构中的最大堆问题。-Using C++ programing language to solve the problems of Max-heap in data structure.