Please enable JavaScript.
Coggle requires JavaScript to display documents.
Lists, Supports ordered storage and sequential access., Can be implemented…
-
-
-
-
ADTs are typically implemented using classes and their interfaces are declared in header files (.h or .hpp).
Example of operations
void clear(List l);
void insert(List l, E item);
void append(List l, E item);
E remove(List l);
void moveToStart(List l);
void moveToEnd(List l);
void prev(List l);
void next(List l);
int length(List l);
int currPos(List l);
void moveToPos(List l, int pos);
E getValue(List l);
Must traverse elements one by one (first, second, third).
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Implementing stacks, queues, and graphs where flexible structures are needed.
-
ADTs define the logical operations that can be perfomed on the data without specifying how these operations are implemented
-
-
-
-
-
-
-
-