overview table continued data structure advantages disadvantages stack provides last-infirst-out access provides first-infirst-out access quick insertionquick deletion quick searchinsertiondeletion (if tree remains balancedquick searchinsertiondeletion tree always balanced quick searchinsertiondeletion tree always balanced similar trees good for disk storage very fast access if key known fast insertion slow access to other items slow access to other items slow search queue linked list binary tree red-black tree tree hash table heap graph fast insertiondeletionaccess to largest item models real-world situations deletion algorithm is complex complex complex slow deletionaccess slow if key not knowninefficient memory usage slow access to other items some algorithms are slow and complex the data structures shown in table except the arrayscan be thought of as abstract data typesor adts we'll describe what this means in "linked lists overview of algorithms many of the algorithms we'll discuss apply directly to specific data structures for most data structuresyou need to know how to insert new data item search for specified item delete specified item