查看会员资料
用 户 名：vvot****
发送消息- 用户积分：0 分
- Email：用户隐藏
- Icq/MSN：987433
- 电话号码：
- Homepage：
- 会员简介：
最新会员发布资源
AVL-Tree
- AVL tree - is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one
Hash table
- Represents a collection of key/value pairs that are organized based on the hash code of the key. Implemented by "Separate chaining" where each bucket is independent, and has list of entries with the same index.
Sparse matrix
- Represents a matrix without zeros
Table on AVL-tree
- Class that represent a table of elements with key and values, implemented using AVL tree.
Set
- Represents a data structure that can store certain values, without any particular order, and no repeated values. It is a computer implementation of the mathematical concept of a finite set.