Frank M. Carrano, University of Rhode Island, Timothy M. Henry, New England Institute of Technology.
Fourth edition.
Boston :
Pearson,
[2015]
xxviii, 897 pages ;
26 cm
Includes index.
Includes bibliographical references and index.
Bags -- Bag implementation that use arrays -- A bag implementation that links data -- The efficiency of algorithms -- Stacks -- Stack implementations -- Recursion -- An introduction to sorting -- Faster sorting methods -- Queues, deques, and priority queues -- Queue, deque, and priority queue implementations -- Lists -- A list implementation that uses an array -- A list implementation that links data -- Iterators for the ADT list -- Sorted lists -- Inheritance and lists -- Searching -- Dictionaries -- Dictionary implementations -- Introducing hashing -- Hashing as a dictionary implementation -- Trees -- Tree implementations -- A binary search tree implementation -- A heap implementation -- Graphs -- Graph implementations.