پاورپوینت ساختمان داده 123 اسلاید

123 اسلاید

Sequential representationsuccessive nodes of the data object are stored a fixed distance apartorder of elements is the same as in ordered listadequate for functions such as accessing an arbitrary node in a table operations such as insertion and deletion of arbitrary elements from ordered lists become expensiveLinked representationsuccessive items of a list may be placed anywhere in memoryorder of elements need not be the same as order in listeach data item is associated with a pointer (link) to the next item