Linear ADTs
From
(Difference between revisions)
(→Data Organization) |
|||
| Line 1: | Line 1: | ||
There are many variations on Linear ADTs, but they all one common organizational structure: each element has a singular successor and a singular predecessor (both of which may be null). There may or may not be any logical ordering based on element values, but there is always a physical ordering of successors and predecessors. So we have: | There are many variations on Linear ADTs, but they all one common organizational structure: each element has a singular successor and a singular predecessor (both of which may be null). There may or may not be any logical ordering based on element values, but there is always a physical ordering of successors and predecessors. So we have: | ||
| + | <br/><br/> | ||
=== Data Organization === | === Data Organization === | ||
Revision as of 19:17, 27 March 2009
There are many variations on Linear ADTs, but they all one common organizational structure: each element has a singular successor and a singular predecessor (both of which may be null). There may or may not be any logical ordering based on element values, but there is always a physical ordering of successors and predecessors. So we have:
Data Organization
Linear relationship of data elements each with a single successor and a single predecessor (either of which may be null).
Common Behaviors
Add
Remove
Find/Get
Size/Count
Empty
