Contents

Linked Lists

This is a deep treaties of the linked list data type or linked lists data objects.
For more info about data structures in general, see Data Structures

The Elements of Data Structures

2.1
2.1.1

Definitions
Defintion I

A bit is that which has no parts. It is either 1 or 0, and cannot be further

broken down into subunits.
2.1.2

Definition II

A byte is a collection of 8 bits. A byte is a set of 8 bits that exist as a whole.

2.1.3

Defintion III

A value is that which can be broken down into bits and bytes and makes
sense as a whole to the computing environment in which it belongs.
A value is a collection of bits or bytes that make sense only as a whole.
2.1.4

Defition IV

A type is a set of values together with the permissible operations that can
be performed on the set.
2.1.5

Defintion V

An object is that which has values and by virtue of its values belongs to
one or more types. Like an individual in a society, it has its identity and
performs operations particular to its types.
2.1.6

Defintion VI

A prime object is that whose only parts are its native bits. Its only values
are the bits that form its bulk, and it can not be expressed as any other
object, but bits in a computing system.
1

2.1.7

Defintion VII

A composite or compound object is that which is made of a collection of one

or more prime objects or other objects of its nature, that is other composite
objects, which could all be of thesame type or dierent types, and together
form a whole.
2.1.8

Defintion VIII

Any object that forms part of a compound object is called a field or member.
2.1.9

Definition IX

A homogenous composite object is that whose members are of the same type.
2.1.10

Defintion X

A heterongeous composite object is that whose members are of dierent

types.