# Linear ADTs

### From

Begin |
↑ Contents: CS2 |
Stacks → |

There are many variations on Linear ADTs, but they all a common organizational structure: each data element that has been added to a Linear ADT has a singular successor and a singular predecessor (either 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

Iterator

**CS2: Data Structures**

Theory of Computation - ADT Preliminaries

**Linear ADTs** - Tree ADTs - Graph ADTs - Unordered Collection ADTs