Data Structure
By: Rizwan Sarwar
DEFINITION
Data structures are specialized formats to organize and store data for
efficient and modification. They are essential in solving real world
problems where managing large amount of data is crucial.
TYPES OF DATA STRUCTURES
There are two types of data structure:
Linear data structures
Non linear data structures
NON-LINEAR DATA STRUCTURE
These structures are not sequential; instead, data is arranged
hierarchically or in a network.
Type
Trees
Graphs
LINEAR DATA STRUCTURE
In linear structures, data is organized in a sequence. Operations like
accessing, adding, or removing elements happen in a linear order.
Types
Arrays
Linked lists
Stacks
Queues
APPLICATIONS OF DATA
STRUCTURES
1) Linked lists
A linked list consists of nodes, where each node, where each node has
data and a pointer to the next node.
Dynamic size
Memory efficient for insertion and deletions. Usage examples:
Web browsers and operating systems
Storing data when frequent insertions and deletions are needed
2)TREES
Trees represent hierarchical data with a root node and child nodes.
Characteristics:
Non linear structure
Each node can have multiple children, but only one parent. Usage
examples:
File System: Files are represented hierarchically.
Database indexing: Speed up searches using binary search trees.
Applications:
Decision making systems like AI
Organization charts
