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

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

  این فایل در قالب فرمت Power Point قابل ویرایش ، آماده پرینت و ارائه به عنوان پروژه پایانی میباشد

    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