Linear ADTs

From

(Difference between revisions)
Jump to: navigation, search
(Common Behaviors)
Line 6: Line 6:
=== Common Behaviors ===
=== Common Behaviors ===
-
Add
+
Add<br/>
-
Remove
+
Remove<br/>
-
Find/Get
+
Find/Get<br/>
-
Size/Count
+
Size/Count<br/>
-
Empty
+
Empty<br/>
 +
<br/><br/>

Revision as of 19:16, 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 with a single successor and a single predecessor (either of which may be null).

Common Behaviors

Add
Remove
Find/Get
Size/Count
Empty


Personal tools
MediaWiki Appliance - Powered by TurnKey Linux