implementation of data structure notes in this unitwe will discuss the distinguish between the usage and the implementation of data structure this difference is crucial in understanding the concept of the separationdefinition and use that should be practiced for designing good software we then present the implementation of few data structures our main purpose of this course is to describe important data structures and to develop algorithms for the various operations on such data structures while presenting data structure we shall discuss ways to represent it in the computer memory in many caseswe shall assume array to be the primitive structure to house other data structures in this contextwe use the term array to mean one-dimensional array having elements of particular type every high level programming language includes facilities to handle arrays and as such implementation of data structure housed in an array does not offer any problem even in assembly or machine languagesa block of contiguous storage locations can be conveniently considered to be an array for the said purpose borrowing the notation of languagewe shall denote an array type as follows[]thusint [ ]will denote an array of elements where is the name of the array an individual element of this array will be denoted by [iwhere < < in generalan element will be shown as [where in many casesthe relations among the elements of data structure need not be explicitly represented because these are implicitly known when the relations need to be explicitly representedthere are two possible approaches either the relations are represented separately (possible as another data structureor the elements are augmented to include additional fields that represent structural information laterwe shall see many examples of both these approaches and as suchwe do not consider any example at this stage it is clear from the above discussion that sometimes an element will also include structural information in such caseswe shall call it node to make minor distinction between the two thus the distinction between node and an element (or componentis that node is an element (or componentplus the structural information (if anycarried into it task every high level programming language includes facilities to handle arrays what about machine level and assembly level languages list adt' an array is an example of list arrays have fixed sizewhich is declared and fixed at the start of the programand therefore cannot be changed while it is running examplesuppose an array of size has been declared at the start of the program lovely professional university