搜索资源列表
New
- queues implementation
jisuanqi
- 计算器，通过用栈和队列的思想，进行简单的计算，识别能力完整对错误的输入会自动报错，其显示计算过程中，入栈出栈的详细过程-Calculator, by using stacks and queues of ideas, simple in calculation, the full recognition of the input the error will automatically error, its display in the calculation process, stack a
MaxHeap
- 最大堆的实现，用于实现优先级队列，使用java实现-MaxHeap realization, used to implement the priority queues, use Java implementation
achvectors
- Delphi 的矩阵库，可以实际动态数组，矩阵产实现搜索等功能-Vectors is a class library for Object Pascal (Delphi 1, 3-7, Borland C++ Builder, Borland Kylix, Free Pascal v.1.0 and higher) which implements vectors (dynamically sized arrays) based on different Object Pascal s
exp8
- 对二叉树的删除、复制、中序遍历采用递归方式实现。 层序遍历采用辅助队列数据结构完成，为了计算层高， 使用了两个队列，交替的向两队列中插入相邻的两层， 这样完成层高的统计。-On the binary tree delete, copy, preorder recursive manner. Traversal sequence complete with assisted queue data structure, in order to calculate storey,