Introduction to Data Structure

Data structure are classified into two types

1. Linear Data Structure
2. Non-Linear Structure

1) Linear Data Structure:

A structure in which data element are organized in sequence is referred to as linear

Example are: arrays, linked lists, stacks, and queues.
In a stack, last item added can be taken off first and In a queue an item can be added at one end, and removed from the other end.

2) Non-Linear Data Structure:
Relationship among elements can be hierarchical. Linkage may be single or bi-directional

Common example are: Trees and Graphics. See figure

It contains an information field and a link field, which is address of related element. Trees can be binary, A V L, Red and Black, Splay, B-trees or heaps.

Graph is set of data items, called vertices or nodes, connected by links termed as edges or arcs