View source

From

You do not have permission to edit this page, for the following reasons:

• This page has been locked to prevent editing.
• The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page:

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). <br/><br/> === Common Behaviors === Add<br/> Remove<br/> Find/Get<br/> Size/Count<br/> Empty<br/> <br/><br/>

Return to Linear ADTs.