briefly explain enough about oop to get you started finallyfor +programmers who don' know javawe'll point out some of the differences between these languages overview of data structures another way to look at data structures is to focus on their strengths and weaknesses in this section we'll provide an overviewin the form of tableof the major data storage structures we'll be discussing in this book this is bird' -eye view of landscape that we'll be covering later at ground levelso don' be alarmed if it looks bit mysterious table shows the advantages and disadvantages of the various data structures described in this book table characteristics of data structures data structure advantages disadvantages array quick insertionvery fast access if index known slow searchslow deletionfixed size ordered array quicker search than unsorted array slow insertion and deletionfixed size stack provides last-infirst-out access slow access to other items queue provides first-infirst-out access slow access to other items linked list quick insertionquick deletion slow search binary tree quick searchinsertiondeletion (if tree remains balanceddeletion algorithm is complex red-black tree quick searchinsertiondeletion tree always balanced complex tree quick searchinsertiondeletion tree always balanced similar trees good for disk storage complex hash table very fast access if key known fast insertion slow deletionaccess slow if key not knowninefficient memory usage heap fast insertiondeletionslow access to other items access to largest item graph models real-world situations some algorithms are slow and complex