>
> There are other data structures out there, like maps and hashes, but these
> three basic types will fill most needs pretty well.
>
There is another major category of data structure which is ideal for
many types problem: trees. Binary trees and other tree structures are
used for problems such as parsing/decomposing languages (especially
logical languages containing evaluable expressions). Tree traversal is
also one of the most common uses for recursion.
In a sense, a tree is just many instances of the simple data types
(vector or multiple linked-lists (in the case of a binary tree)), but
because of the uses and behavior of these structures it is worth
zooming-out and considering the tree as a different beast.
--ronan
This archive was generated by hypermail 2.1.3 : Fri Aug 01 2014 - 19:43:01 EDT