1.)
linked list is a
data structure consisting of a group of
nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a
reference (in other words, a
link) to the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any position in the sequence.
2.)
queues-is a particular kind of
abstract data type or
collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal.
3.)
stacks- is a last in, first out (
LIFO)
abstract data type and linear
data structure. A stack can have any
abstract data type as an
element, but is characterized by only three fundamental operations:
push,
pop and
stack top.
4.)array- is a
data structure consisting of a collection of elements (
values or
variables), each identified by at least one
index.
