Description: 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.
File list (Check if you may need any files):
Download