Introduction - If you have any usage issues, please Google them yourself
data structure array.h : security arrays can be automatically size (random access, but expanded inefficient) linkedlist.h : General Linked List (available random access, the visit inefficient) dclinkedlist : two-way cycle Chain (non-random access, insertion, Traversing the efficiency higher than ordinary Chain) hashtable.h : Hash Table (using keys logo elements, keys to the same element that is considered equal. take Heavy == Operators Hash with user-defined functions) binstree.h : Binary Tree Search (and required heavy ==
Packet : 119128665datastr.rar filelist
datastr\array.h
datastr\avltree.h
datastr\avltreenode.h
datastr\binstree.h
datastr\dclinkedlist.h
datastr\dnode.h
datastr\hashtable.h
datastr\linkedlist.h
datastr\node.h
datastr\treenode.h
datastr\说明.txt
datastr