Scribd
Upload
7 views27 pages

Introduction (types)

The document provides an overview of data structures, defining them as logical ways to store and retrieve data. It categorizes data structures into linear (such as arrays, stacks, queues, and linked lists) and non-linear (such as trees and graphs), detailing operations like traversing, searching, insertion, and deletion for each type. Additionally, it includes representations for arrays, stacks, queues, linked lists, trees, and graphs.

Uploaded by

Hasnain Nisar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views27 pages

Introduction (types)

The document provides an overview of data structures, defining them as logical ways to store and retrieve data. It categorizes data structures into linear (such as arrays, stacks, queues, and linked lists) and non-linear (such as trees and graphs), detailing operations like traversing, searching, insertion, and deletion for each type. Additionally, it includes representations for arrays, stacks, queues, linked lists, trees, and graphs.

Uploaded by

Hasnain Nisar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 27

Data Structure Algorithms &

Applications

1
Data Structure
And its types

2
Data Structure

It is a logical way to storing the


data and it also define
mechanism of retrieve data.

3
Types of Data Structure
Data
Structure

NON
LINEAR
LINEAR

4
Data Structure Operation
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 : add a new record to the structure


Deletion : removing a record from the structure
5
Linear Data Structure
1.Array
2.Stack
3.Queue
4.Linked List

6
Array
:-An array is a collection of
homogeneous type of data
elements.
:-An array is consisting of a
collection of elements .
7
Operation Performed On
Array
1.Traversing
2.Search
3.Insertion
4.Deletion
5.Sorting
6.Merging

8
Representation of Array
AAA 1
BBB 2
CCC 3
DDD 4
EEE 5

9
Array Representation

10
Stack
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.
11
Representation of Stack
EEE TOP
DDD
CCC
BBB
AAA

12
Stack Representation

13
Queue
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.
Operation Performed On Queue

Insertion : Add A New Element In Queue


Deletion: Removing An Element In Queue

15
Representation of Queue

55 65 75

16
Queue Representation

17
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

18
Operation Performed on Linked
List
1.Traversing
2.Searching
3.Insertion
4.Deletion

19
Linked Representation

20
2.Non Linear
1.Tree
2.Graph

21
Tree
In computer science, a treeis a widely-
used data structure that emulates a
hierarchical tree structure with a set of
linked nodes.

22
Operation On Tree

1.Insertion
2.Deletion
3.Searching

23
Tree Representation

24
Graph

A graph data structure may also associate to each edge some edge
value, such as a symbolic label or a numeric attribute
(cost, capacity, length, etc.).

25
Operation Performed
Graph
1.Searching
2.Insertion
3.Deletion
Graph Representation

27

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy