This document defines and describes different types of data structures. It discusses linear data structures like arrays, linked lists, stacks and queues. It explains how each stores and organizes data and common operations performed on them like insertion, deletion and traversal. The document also covers non-linear data structures of trees and graphs, how they represent relationships between data elements, and typical operations conducted on them.

1. DATA STRUCTURE AND
ITS TYPES
PRESENTED BY
RAMEESHA SADAQAT

2. CONTENTS
DEFINITION OF DATA STRUCTURES
DATA STRUCTURE OPERATIONS
TYPES OF DATA STRUCTURE
LINEAR DATA STRUCTURE
NON-LINEAR DATA STRUCTURE

3. DEFINITION OF
DATA
STRUCTURES
It is a logical way of storing data
and it also define mechanism of
retrieve data.

4. DATA STRUCTURE
OPERATIONS
 Traversing: Accessing each record exactly once
so that certain item in the record may be
processed.
 Searching: finding the location of the record
with a given key value .
 Insertion :adding a new record to the
structure
 Deletion : removing a record from the structure

5. Types of data structure
TYPES OF
DATA
STRUCTURE
•NON-
LINEAR
•LINEAR

6. LINEAR DATA STRUCTURE
 ARRAY
 LINKED LIST
 STACK
 QUEUE

7. ARRAY
 An array is a collection of
homogeneous type of data elements.
 An array is consisting of a collection of
elements .
REPRESENTATION OF ARRAY IN MEMORY
1
2
3
4
5

8. OPERATIONS PERFORMED
ON AN ARRAY
Traversing
Searching
Insertion
Deletion
Sorting
Merging

9. ARRAY REPRESENTATION

10. LINKED LIST
 A Linked list is a linear collection of
data elements .It has two part one is
info and other is link part.info part
gives information and link part is
address of next node.

11. OPERATIONS PERFROMED
ON LINKED LIST
Traversing
Searching
Insertion
Deletion

12. LINKED LIST
REPRESENTATION

13. stack (lifo)
 A Stack also called last in first out (LIFO)
system.
 A Stack is a list of elements in which an
element may be inserted or deleted at
one end which is known as TOP of the
stack.
EEE TOP
DDD
CCC
BBB
AAA

14. Operations performed
on stack
 Push: add an element in stack
 Pop: remove an element in stack

15. stack representation

16. queue (fifo)
 A Queue also called first in first out (FIFO)
system.
 A queue is a linear list of element in which
insertion can be done at one end which is
known as front and deletion can be done
which is known as rear.
3 2 1

17. Operations performed
on queue
 Insertion : add a new element in queue.
 Deletion: Removing an element in queue.

18. Queue representation

19. Non-linear data
structure
TREE
GRAPH

20. TREE
 Data frequently contain a hierarchical
relationship between various elements.
The data structure which reflects this
relationship is called tree.

21. Operations performed
on tree
Insertion
Deletion
Searching

22. Tree representation

23. graph
 Data sometimes contain a relationship
between pairs of elements which is not
necessarily hierarchical in nature.
 For example, an airline flies only between
cities connected by lines.

24. Operations performed
on graph
Searching
Insertion
Deletion

25. graph representation