Hardcover

ISBN 10: 0024209716 ISBN 13: 9780024209719

Publisher: Prentice Hall, 1996

This book uses a modern object-oriented approach to data structures, unified around the notion of the Standard Template Library (STL) container classes. The book presents a systematic development of data structures supported by numerous examples and complete programs. The authors separate the applications of a data structure from its implementation. Includes an applied study of interesting and classical algorithms that illustrate the data structures using only simple mathematical concepts (Big-O notation is introduced intuitively); Many additional figures are integrated into the presentation; ADT (Abstract Data Type) for each data structure—immediately used to solve appropriate problems; Early and accessible introduction to templates and iterators; Use of modern C++ constructs in developing data structures and their applications provides enough language detail to sufficiently understand the constructs.

From the Publisher:

This book uses a truly object-oriented perspective to concentrate on teaching data structures rather than C++ language features. Each major data structure is introduced with a corresponding collection class. This streamlined approach allows the authors to cover advanced topics such as templates, graphs, searching, sorting, dictionaries, and files. Excellent case studies are also included.

From the Back Cover:

This book presents data structures as an integrated subject that includes organization and management of data, program design and implementation, and a mastery of programming techniques. It emphasizes abstract data types (ADTs) and their implementation in C++ classes, and features numerous examples and complete test programs, applications, and case studies developed using software and engineering principles that emphasize good programming principles in a realistic setting. Covers topics such as fundamentals of data structures; control structures; functions and scope; structured data types; C++ classes; stacks and queues; pointers; linked lists; templates; recursion; trees; object oriented programming; files; searching and sorting; and advanced class concepts.