Types of Data Structure
I rely on your support to keep this website running. If you find the content valuable, please consider making a small donation. whether itâs âč25/$1 or âč500/$5.
DonateSecured by Stripe
In this lecture we're going to cover basic about Types of Data Structure.
Types
There are many types of Data Structure but in this lesson we're going to talk about two main types of data Structure.
 Primitive Data Structure
 Non Primitive Data Structure
Other Types
 Primitive Data Structure
 Non Primitive Data Structure
 Linear Data Structure
 Non Linear Data Structure
 Static Data Structure
 Dynamic Data Structure
 Homogeneous Data Structure
 Non Homogeneous Data Structure
1. Primitive Data Structure

The primitive data types are the fundamental datatypes.

Example: Int Float Double, Char

Now in the primitive, there are two types,


Numeric:
 Int: Numbers with positive, negative values and whole numbers basically not decimal
 Example: 23,6,0,1
 Real numbers or float numbers: These represent numbers having decimal points.
 Example: 1.5, 3.534, 0.43



Non Numeric:
 CHAR: character type of data.
 Example: a to OR A to Z
 Pointer: It is a datatype that represents the memory address of a variable. Pointers can also be used to access the memory address of a variable.


 Booleans: AKA logical,
 It can represent value either as TRUE or FALSE.
 0 = False, 1 = True

2. Non Primitive Data Structure

These can be derived using any primitive datatype

There are two types of Primitive Datatype

Linear Data Structure:

Array:
 It is a collection of similar kinds of data.

Stack:
 In data structure, insertion and deletion are performed at one end only.
 It is also known as LIFO [Last in First out]

Queue:
 In data structure, insertion at one end and deletion at the other end.
 It is also known as FIFO [First in First out]

List:
 A list can be defined as a collection of variables of a number of items.


2. Nonlinear Data Structure

Tree: [We'll learn more about this in upcoming lectures]

Graph:
 It is a collection of vertices (Node) and edges.
More details will be covered in upcoming lectures.