文件名称:datast
介绍说明--下载内容均来自于网络,请自行研究使用
array.h: 安全数组 linkedlist.h: 普通表 dclinkedlist: 双向循环链表 hashtable.h: 哈希表 binstree.h: 二叉搜索树 avltree.h: AVL 树 如果要存储集合(元素不可重复)并快速查找,最佳的是 binstree.h(二叉搜索树)。 如果要存储二维或更高维的表格,最佳的是 hashtable.h(哈系表)。AVL 树的插入成本非常高(删除函数也没有实现),但 AVL 的搜索效率极高,所以适用于在程序开始前初始化程-NOTE:
array.h :secure array,linkedlist.h:common table,
dclinkedlist:dual cycle linkedlist,
hashtable.h:hash table
binstree.h:binary search tree,
avltree.h: AVL tree,
if you want to store set(elements no repeating) and to lookup it swiftly,best is binstree.h(binary search tree).if you want to store two dimensions s or more dimensions s table,best hashtable.h(hash table).the cost of AVL tree s insertion is very high(delete function is not completed),but effiency of AVL tree s search is very high,so it is the same with initialize programme before beginning programme.
array.h :secure array,linkedlist.h:common table,
dclinkedlist:dual cycle linkedlist,
hashtable.h:hash table
binstree.h:binary search tree,
avltree.h: AVL tree,
if you want to store set(elements no repeating) and to lookup it swiftly,best is binstree.h(binary search tree).if you want to store two dimensions s or more dimensions s table,best hashtable.h(hash table).the cost of AVL tree s insertion is very high(delete function is not completed),but effiency of AVL tree s search is very high,so it is the same with initialize programme before beginning programme.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
datastr
.......\array.h
.......\avltree.h
.......\avltreenode.h
.......\binstree.h
.......\dclinkedlist.h
.......\dnode.h
.......\hashtable.h
.......\linkedlist.h
.......\node.h
.......\treenode.h
.......\说明.txt
.......\array.h
.......\avltree.h
.......\avltreenode.h
.......\binstree.h
.......\dclinkedlist.h
.......\dnode.h
.......\hashtable.h
.......\linkedlist.h
.......\node.h
.......\treenode.h
.......\说明.txt