C/C++常用的数据结构类

包括：

array.h：　　安全数组，可自动增长大小（随机访问，但扩充时效率低）

linkedlist.h：　　普通链表（可随机访问，但访问效率低）

dclinkedlist：　　双向循环链表（不可随机访问，但插入、遍历的效率都比普通链表高）

hashtable.h：　　哈希表（使用键值标识元素，键值一样的元素即认为相等，需重载 == 运算符并由用户定义哈希函数）

binstree.h：　　二叉搜索树（需重载 == 和 < 运算符）

avltree.h：　　AVL 树（需重载 == 和 < 运算符）-C/C++ Commonly used data structure includes: array.h: security array, can automatically increase in size (random access, but when the expansion of low efficiency) linkedlist.h: general list (which can be random access, but the low efficiency ) dclinkedlist: two-way circulation list (non-random access, but the insert, traverse the list of high efficiency than ordinary) hashtable.h: hash table (using the key identity elements, the same key elements that are equally divided, to be Overloading == operator by user-defined hash function) binstree.h: binary search tree (to be overloaded == and