EPPriemy :- If the choice of a data structure. for implementing a particular ADT is proper, it makes program very etticient in terms of time and space
Reusability :- The data structure provides reusability means that multiple client programs can use the data Structure
Abstraction:- The data structure specified by the ADT diso provides level of abstraction. The client cannot see interval working of data structure, so
it does not have to worry about implementention.
Operations on Data structure :-
1)Traversing:-
Every data structure contains. set of data elements. Traversing data structure means visiting each element of data structure. in order to perform some specific operation.
like searching or surting. Example :- If we need to calculate average. of marks obtained by a student in a different subject, we need to traverse complete array of marks and calculate total sum, then we will device that sum by no. of subjects ie. 6 to find average.
2)Insertion :-
Insertion can be defined as the process of adding the elements to the data Structure at any location.
If the size of data structure is ʼn then we can only insert n-1 data elements to it.
3)Deletion:-
The process of removing an element from the data structure is called deletion. we Can delete an element from data structure at any random location.
If we try to delete. an element from an empty data structure then underflow occurs.
4)searching:-
The process of finding the location of an element within data structure is called searching. There are two alganthms to perform
5). Sorting :-
The process of arranging the data structure in a specific order is called as sorting. There are many algonthms that can be used to perform sorting, for example, insertion sort, selection sort, bubble sort etc.
6).merging size m :-
when two lists list A and list 8 of and & respectively, of similar type of elements, clubbed or joined to produce third list, list c of size (M+N), then this process is called merging.