What are the different operations performed on data structures? Explain with an example.

Different operations performed on data structures:

Data structures are organized collections of data that can be accessed and updated efficiently. Various operations can be performed on data structures to manage and manipulate the data they contain. The specific operations available depend on the type of data structure being used.

1. Insertion:

• Inserting an element adds a new item to the data structure.
• Example: Adding a new node to a linked list, inserting an item into an array at a specific index, or pushing an element onto a stack.
• Notation: insert(element)

2. Deletion:

• Deleting an element removes an existing item from the data structure.
• Example: Removing a node from a linked list, deleting an item from an array at a specific index, or popping an element from a stack.
• Notation: delete(element) or remove(element)

3. Traversal/Iteration:

• Traversal involves visiting each element in a data structure and performing some operation on it.
• Example: Printing the contents of a linked list, displaying the elements of an array, or processing the nodes of a tree.
• Notation: traverse(data_structure)

4. Search:

• Searching involves finding a specific element or item within a data structure.
• Example: Finding a particular value in an array, locating a node with a specific key in a tree, or searching for a word in a hash table.
• Notation: search(element) or find(element)

5. Update:

• Updating involves modifying the value or contents of an existing element in the data structure.
• Example: Changing a value in an array, updating a field in a database record, or modifying the properties of a node in a graph.
• Notation: update(element, new_value)

6. Sorting:

• Sorting involves arranging the elements in a data structure in a specific order, such as ascending order or descending order.
• Example: Sorting an array of numbers, ordering a list of strings alphabetically, or sorting a collection of objects based on a property.
• Notation: sort(data_structure)

7. Merging:

• Merging combines two or more data structures into a single unified structure.
• Example: Merging two sorted arrays into a single sorted array, concatenating two linked lists, or объединение двух множеств.
• Notation: merge(data_structure1, data_structure2)

8. Splitting:

• Splitting divides a data structure into two or more smaller structures.
• Example: Splitting a linked list into two parts, partitioning an array into multiple segments, or dividing a tree into subtrees.
• Notation: split(data_structure, criteria)

9. Reversing:

• Reversing changes the order of elements in a data structure from front to back or vice versa.
• Example: Reversing an array, inverting a linked list, or flipping the nodes of a binary tree upside down.
• Notation: reverse(data_structure)

10. Copying:

• Copying creates a duplicate or replica of a data structure.
• Example: Creating a copy of an array, cloning a linked list, or duplicating a tree.
• Notation: copy(data_structure)