{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Data Structures and Implementation_Unit4_GP

Data Structures and Implementation_Unit4_GP - Rationale for...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Rationale for the choice of data structures with attention to efficient use of system resources Linked lists are often referred to as one of the simpler and more universal of data structures. Linked lists can be utilized to apply numerous additional usual conceptual data structures, such as queues, stacks or even arrays of certain nature, even without the utilization of a list to base the implementation of the structure. The primary advantage of the linked list data structure over say, an array, is primarily that the elements within the linked list structure can be effortlessly added and detached without the need to transfer or restructure the entirety of the composition simply because it is not necessary for the data to be stockpiled alongside utilizing memory or upon a disk format.( Mansfield,1999) Linked lists data structures also permit inclusion and exclusion of nodes to take place anywhere within the list, and can be accomplished with a stable
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}