Unordered Collection ADTs
From
(Difference between revisions)
| (One intermediate revision not shown) | |||
| Line 4: | Line 4: | ||
<br/> | <br/> | ||
| - | + | '''Unordered collection ADT's''' are the most free-form containers that we will consider. They are containers that do not specify any structural relationship between the elements (unlike lists, trees, and graphs in which elements have a structural relationship to each other). '''Hash tables''' do not specify a relationship between items, but they do specify a technique for insert and retrieval. '''Sets, bags, maps, and dictionaries''' are do not imply any formal structure, so depending upon the specific use, there are common implementations that use balanced trees or hash tables internally as the container. | |
---- | ---- | ||
{{CS2/ChapNav}} | {{CS2/ChapNav}} | ||
---- | ---- | ||
[[Category:CS2|{{SUBPAGENAME}}]] | [[Category:CS2|{{SUBPAGENAME}}]] | ||
Current revision as of 16:14, 3 June 2009
| Begin | ↑ Contents: CS2 | Sets and MultiSets (Bags) → |
Unordered collection ADT's are the most free-form containers that we will consider. They are containers that do not specify any structural relationship between the elements (unlike lists, trees, and graphs in which elements have a structural relationship to each other). Hash tables do not specify a relationship between items, but they do specify a technique for insert and retrieval. Sets, bags, maps, and dictionaries are do not imply any formal structure, so depending upon the specific use, there are common implementations that use balanced trees or hash tables internally as the container.
CS2: Data Structures
Theory of Computation - ADT Preliminaries
Linear ADTs - Tree ADTs - Graph ADTs - Unordered Collection ADTs
