116 B Survey KH21

DATA STRUCTURES:
LINEAR DATA STRUCTURE:
A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc.

KINDS OF LINEAR DATA STRUCTURES:

1. Array- an array is a data structure consisting of a group of elements that are accessed by indexing.

2. Deque- a deque (short for double-ended queue) is an abstract data structure for which elements can be added to or removed from the front or back.

3. Linked list- a linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.

4. Queue- A queue (pronounced /kjuː/) is a particular kind of 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 position.

5. Stack- a stack is a temporary abstract data type and data structure based on the principle of Last In First Out (LIFO). Stacks are used extensively at every level of a modern computer system.

NON LINEAR DATA STRUCTURE:
Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree, etc.

KINDS OF NON LINEAR DATA STRUCTURES:

1. Graph data structures- an abstract data type representing relationships or connections

2. Tree data structures- a widely-used data structure that emulates a tree structure with a set of linked nodes.