cj said:
Thank you, Karl. I will certainly do that as well.
Just wanted to get some input from skilled people as well.
1. Don't top-post, rearranged.
Replies are appended to the bottom or interspersed throughout
the reply.
2. Good quality books on data structures will have a table
of comparison, stating what the structure is used for and
how it relates to close siblings. For example, a linked
list, array, stack and vector are all containers and close
siblings. Each is more efficient than the others at specific
tasks. However, sets, maps, associative arrays, and trees
are different than the above and should not be compared with
them.
3. When referring to data types, please do not abbreviate. Some
posters use BST for Binary Search Tree, and my personal peeve,
"ADT" for abstract data type.
Here are a few names of common data structures:
container, collection, sequence, singly linked list, doubly linked
list, table, hash table, vector, array, map, set, bag, skip list,
binary tree, b-tree, trie, tree, avl tree, red/black tree,
graph, edge list, bucket, stack, queue, deque, circular queue
or ring buffer, buffer, double-buffer, string, and database.
There are also custom hybrids containing two or more of the above
structures.
--
Thomas Matthews
C++ newsgroup welcome message:
http://www.slack.net/~shiva/welcome.txt
C++ Faq:
http://www.parashift.com/c++-faq-lite
C Faq:
http://www.eskimo.com/~scs/c-faq/top.html
alt.comp.lang.learn.c-c++ faq:
http://www.raos.demon.uk/acllc-c++/faq.html
Other sites:
http://www.josuttis.com -- C++ STL Library book