Operation In data structure

 

OPERATION IN DATA STRUCTURE :

                                                        Normally operations can be performed in any Data structure. When you're writing any kind of data structure program. Your program should contain these operations. Without data structure operation you can't do anything in your program.

traversal :

                     traversal which means, moving one number to another number. In the data structure view, we are moving one data part to another data part. this is called traversal.

Insertion:

                         In insertion, we are just adding one element to the structure. While inserting the element, it allocates            a new memory location for our new element value.

Searching :

                           In searching just we are finding if the given value number is present or not in our list. 

If it's present, it returns true, or else it returns false.

Sorting:

                  In data, structure sorting has played an important role. While entering the data to the linked list or tree, We have to sort the element for improving coding easy and easy to do any operation. there are more kinds of sorting is there one is bubble sort, merge sort, insertion sort, quick sort, heap sort

.etc. We know only ascending and descending sorting only. In upcoming slides, we will see sorting in depth.

Merging :

               In merging, we are going to combining two are more elements. after merging the new element
, it will form a new memory set for merged data. 

                                        

the above all the operation are most important. When you stating the coding based on data structure these all are mandatory for improving your skills inroad.