پاورپوینت در مورد ساختمان داده به زبان انگلیسی مقدمه در زیر امده است

Sequential representation

successive nodes of the data object are stored a fixed distance apart

order of elements is the same as in ordered list

adequate for functions such as accessing an arbitrary node in a table

operations such as insertion and deletion of arbitrary elements from ordered lists become expensive

Linked representation

successive items of a list may be placed anywhere in memory

order of elements need not be the same as order in list

each data item is associated with a pointer (link) to the next item

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