Data Structures Tutorial
Welcome to the Data Structures Tutorial. This website provides a comprehensive guide to understanding various data structures and algorithms.
What is Data Structure?
→ Data can be arranged in many ways, logical or mathematical arrangement of a data is called Data structure.
Examples: Array, LinkedList, Stack, Queue, Tree, Graph and many more.
What is an Algorithm?
→ Sequence of steps performed on the data using efficient data structures to solve a given problem.
Example: Sorting an Array.
Classification of Data Strycture?
Types of Data Structures
a. Primitive and Non-Primitive Data Structure
b. Static and Dynamic Data Structure
c. Persistent and Ephemeral Data Structure
Non-Primitive further Divided into two Types:
i). Linear Data Structure
ii). Non-Linear Data Structure
Persistent further Divided into three types:
i). Partially Persistent
ii). Fully Persistent
iii). Confluently Persistent
Data Structure Operations:
The following four operations play a major role:
1. Traversing:
Accessing each record exactly once so that certain items in the record may be processed.
2. Searching:
Finding the location of the record with a given key value.
3. Inserting:
Adding a new record to the structure.
4. Deleting:
Removing a record from the structure.
5. Merging:
Combining the records in two different sorted files into a single sorted file.
6. Sorting:
Arranging the record in some logical order.