- Published on
Types of Data Structures Explained - Primitive, Linear, and Non-Linear
Now that you understand what data structures are and why they matter, let's look at the different types of data structures used in programming.
1. Primitive Data Structures
These are the simplest data types and the basic building blocks of data:
- Integer: Whole numbers like 1, 2, or 10 (e.g., number of apples).
- Float: Real numbers with decimals, like 2.5 or 3.14 (e.g., weight of bananas).
- Character: A single letter, number, or symbol like ‘A' or ‘3'.
- Boolean: Holds only
true
orfalse
.
Think of primitive data as single items on your shopping list.
2. Non-Primitive Data Structures
These are more complex structures made from primitive types, divided into:
Linear Data Structures
Data elements are arranged in a sequence, like people lined up in order.
- Arrays: Like a row of lockers, each with an index and a value.
- Linked Lists: A chain where each item points to the next one.
- Stacks: A pile of books — you only add or remove the top item (Last In, First Out).
- Queues: Like a line at a grocery store — first come, first served (First In, First Out).
Non-Linear Data Structures
Data elements are arranged without a strict sequence.
- Trees: Like a family tree, where each node connects to parents and children.
- Graphs: Like social networks, with nodes (people) connected in many ways.
What's Next?
This is a basic overview of data structures. Next, we'll start diving deeper with the Array data structure. But first, we'll learn about Big-O notation — a way to measure how efficient these data structures and their operations are.