Operations Operations_on_Data_Structures.pptx

Operations on data structures
Operations on Data Structures 🧩

Data structures store and organize data efficiently. Operations are the actions we perform to manipulate or access that data.


---

🔹 1. Basic Operations on Data Structures

These are common to almost all data structures:

Operation Description Example

Traversal Accessing each element once to process it. Printing all elements of an array.
Insertion Adding a new element. Adding a node to a linked list.
Deletion Removing an element. Deleting a record from a queue.
Searching Finding the location of a particular element. Searching for a number in an array.
Sorting

Operations on Data Structures 🧩

Data structures store and organize data efficiently. Operations are the actions we perform to manipulate or access that data.


---

🔹 1. Basic Operations on Data Structures

These are common to almost all data structures:

Operation Description Example

Traversal Accessing each element once to process it. Printing all elements of an array.
Insertion Adding a new element. Adding a node to a linked list.
Deletion Removing an element. Deleting a record from a queue.
Searching Finding the location of a particular element. Searching for a number in an array.
Sorting Arranging data in order (ascending/descending). Sorting names alphabetically.
Merging Combining two structures into one. Merging two sorted arrays.
Updating Changing an existing element. Updating a student's marks in a record.



---

🔹 2. Operations by Data Structure Type

🧱 Array

Traverse

Insertion (at a position)

Deletion

Searching (Linear or Binary)

Sorting


🔗 Linked List

Insertion (beginning, end, or middle)

Deletion (by value or position)

Traversal

Searching


📚 Stack

Push: Add an element on top.

Pop: Remove the top element.

Peek/Top: Access the top element without removing it.

isEmpty / isFull checks.


🧾 Queue

Enqueue: Add an element at the rear.

Dequeue: Remove an element from the front.

Front/Rear: Access front and rear elements.


🌳 Tree

Traversals: Preorder, Inorder, Postorder

Insertion

Deletion

Searching


🕸️ Graph

Traversal (DFS, BFS)

Adding or removing vertices/edges

Searching for a path



---

🔹 3. Types of Operations (Based on Purpose)

Category Operations Examples

Creation/Initialization Create structure Create an empty linked list
**Manipulation

1. Operations on Data Structures Basic and Advanced Operations Explained

2. Introduction Operations on data structures define the ways we can store, retrieve, and manage data efficiently. They are classified into basic and advanced operations.

3. Basic Operations • Traversal – Accessing each element exactly once • Insertion – Adding a new element • Deletion – Removing an element • Searching – Finding the location of an element • Updating – Modifying the value of an existing element

4. Advanced Operations • Sorting – Arranging elements in a particular order • Merging – Combining two data structures into one • Splitting – Dividing a data structure into smaller structures

5. Example Table Traversal – Looping through array Insertion – Push in stack Deletion – Pop from stack Searching – Binary search Updating – Update record in DB Sorting – Quick sort Merging – Merge sorted arrays

6. Conclusion Understanding operations on data structures is essential for choosing the right algorithm and ensuring efficient program execution.