Data structures
Download
1 / 7

Data Structures - PowerPoint PPT Presentation


  • 52 Views
  • Uploaded on

Data Structures. 1-D arrays, linearly-linked lists and binary search trees. Overview. This slide show discusses 1-D arrays and compares them with two sorts of linked list, linearly linked lists and binary search trees in regard to their properties in relation to (a) insertion,

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Data Structures' - gayora


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Data structures

Data Structures

1-D arrays, linearly-linked lists and binary search trees


Overview
Overview

This slide show discusses 1-D arrays and compares them with two sorts of linked list, linearly linked lists and binary search trees in regard to their properties in relation to

(a) insertion,

(b) deletion and

(c) searching.


1 d arrays
1-D arrays

  • Can’t dynamically grow and shrink. (-)

  • Difficult to insert and delete. (-)

  • Extraordinarily good searching of sorted arrays, of the order of log2n where n is the number of elements in the array. (+)


Linear linked lists
Linear linked lists

  • Can grow and shrink dynamically.(+)

  • Easy to insert and delete. (+)

  • Extremely bad search time, making them useless if used to provide long lists. (-)


Binary search trees
Binary Search Trees

  • Can grow and shrink dynamically. (+)

  • Easy to insert and delete. (+)

  • Easy to search, even for extremely long lists. (+)


Conclusion
Conclusion

Binary search trees come out on tops as having all the advantages and none of the disadvantages.

Now go to the last slide to see the summary sheet.



ad