Linear ADTs

From

(Difference between revisions)
Jump to: navigation, search
(Created page with 'There are many variations on Linear ADTs, but they all one common organizational structure: each element has a singular successor and a singular predisessor (both of which may be...')
m (Common Behaviors)
 
(9 intermediate revisions not shown)
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 predisessor (both of which may be null).  There may or may not be any other logical ordering, but there is always a physical ordering of successors and predisessors.
+
<noinclude>
 +
{{CS2:BookNav|base=/|up=Contents: CS2|prev=|next=Stacks}}
 +
</noinclude>
 +
<br/>
 +
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:
 +
<br/><br/>
 +
 
 +
=== 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/>
 +
Iterator<br/>
 +
<br/><br/>
 +
----
 +
{{CS2/ChapNav}}
 +
----
 +
[[Category:CS2|{{SUBPAGENAME}}]]

Current revision as of 19:29, 11 May 2012

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


Personal tools
MediaWiki Appliance - Powered by TurnKey Linux