Home > Store

Data Structures with C++ Using STL, 2nd Edition

Register your product to gain access to bonus material or receive a coupon.

Data Structures with C++ Using STL, 2nd Edition


  • Your Price: $198.32
  • List Price: $233.32
  • Usually ships in 24 hours.



  • NEW - Data structures presented using the model of the Standard Template Library (STL)—Over the course of the book, student master the use and implementation of the STL container classes.
    • Teaches students the modern approach to data structures. Ex.___

  • NEW - Simple algorithms integrated throughout the text.
    • 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). Ex.___

  • NEW - Many additional figures integrated into the presentation.
    • Lead students through the concepts. Ex.___

  • NEW - ADT (Abstract Data Type) for each data structure—Immediately used to solve appropriate problems.
    • Book provides students with many examples before presenting the corresponding implementation so that students see a data structure unfold and are then able to trace back through the examples when looking at the implementation. Ex.___

  • NEW - Early and accessible introduction to templates and iterators.
    • Allows students to understand and use powerful abstractions available in modern data structures. Ex.___

  • NEW - Later chapters (Chapters 11 - 17) supplement the CS2 course.
    • Appropriate material for an advanced data structures and algorithms course. Ex.___

  • Use of modern C++ constructs in developing data structures and their applications—Provides enough language detail to sufficiently understand the constructs. A fuller explanation of language details available on the Companion Website.
    • Reflects the type of data structures that students would use in the real world. Ex.___

  • Extensive pedagogy—Includes many complete programs with output, case studies, review exercises with solutions, extensive written exercises and programming exercises, programming projects, and glossary of key terms.
    • Helps students learn, review, and retain material. Ex.___


  • Copyright 2002
  • Dimensions: 7-1/2" x 9-1/8"
  • Pages: 1072
  • Edition: 2nd
  • Book
  • ISBN-10: 0-13-085850-1
  • ISBN-13: 978-0-13-085850-4

This long-awaited second edition of Data Structures with C++ Using STL, by Professors Ford and Topp, provides a modern object-oriented approach to data structures using the model of the Standard Template Library (STL). The authors unify the study of data structures around the concepts of containers and iterators. The book skillfully develops algorithms for the data structures and their applications. Readers will find a systematic and detailed implementation for each data structure. These successful authors offer a learning tool that is motivated by a wealth of excellent examples and complete running programs.


  • Uses the early chapters to present object design and programming principles that are at the core of data structures.
  • Develops clear and concise templates, which can support generic programming throughout the book.
  • Uses the STL container classes throughout the book.
  • Presents an Application Programming Interface (API) for each STL container and immediately uses it to solve problems.
  • Demonstrates the implementation of the STL classes by developing mini-container classes that use the corresponding STL interface. The student can understand the overall design of the container and its C++ implementation code.
  • Includes and intuitive and precise introduction to iterators that are at the core of modern data structures.
  • Covers with the same careful style advanced topics such as red-black trees, hash tables, heaps, and graphs.
  • Provides the reader with an extensive development of advanced recursion and inheritance as applied to data structures.
  • Makes available valuable pedagogical features including chapter objectives and summaries; many complete programs with runtime output; case studies; review exercises with solutions for each chapter; extensive written and programming exercises; and a programming project for each chapter.
  • Supplement: Instructor CD with solutions and a test item file; Companion Website containing language tutorials, students assessment materials, and PowerPoint slides.

Sample Content

Table of Contents

(Most chapters end with Chapter Summary, Classes and Libraries in the Chapter, Review Exercises, Written Exercises, Programming Exercises and Programming Projects.)
1. Introduction to Data Structures.

What is this Book About? Abstract View of Data Structures. An ADT as a Class. Implementing C++ Classes. Declaring and Using Objects. Implementing a Class with Inline Code. Application Programming Interface(API). Strings.

2. Object Design Techniques.

Software Design. Handling Runtime Errors. Object Composition. Operator Overloading.

3. Introduction to Algorithms.

Selection Sort. Simple Search Algorithms. Analysis of Algorithms. Analyzing the Search Algorithms. Making Algorithms Generic. The Concept of Recursion. Problem Solving with Recursion.

4. The Vector Container.

Overview of STL Container Classes. Template Classes. The Vector Class. Vector Applications.

5. Pointers and Dynamic Memory.

C++ Pointers. Dynamic Memory. Classes Using Dynamic Memory. Assignment and Initialization. The Minivector Class. The Matrix Class.

6. The List Container and Iterators.

The List Container. Iterators. General List Insert And Erase Operations. Case Study: Graduation Lists.

7. Stacks.

The Stack ADT. Recursive Code and the Runtime Stack. Stack Implementation. Postfix Expressions. Case Study: Infix Expression Evaluation.

8. Queues and Priority Queues.

The Queue ADT. The Radix Sort. Implementing the Miniqueue Class. Case Study: Time-Driven Simulation. Array Based Queue Implementation. Priority Queues.

9. Linked Lists.

Linked List Nodes. Building Linked Lists. Handling The Back of the List. Implementing a Linked Queue. Doubly Linked Lists. Updating A Doubly Linked List. The Josephus Problem. The Minilist Class. Selecting a Sequence Container.

10.Binary Trees.

Tree Structures. Binary Tree Nodes. Binary Tree Scan Algorithms. Using Tree Scan Algorithms. Binary Search Trees. Using Binary Search Trees. Implementing the Stree Class. The Stree Iterator (Optional).

11. Associative Containers.

Overview of Associative Containers. Sets. Maps. Multisets. Implementing Sets And Maps.

12. Advanced Associative Structures.

Hashing. Designing Hash Functions. Designing Hash Tables. The Hash Class. Hash Table Performance. 2-3-4 Trees. Red-Black Trees. The Rbtree Class.

13. Inheritance and Abstract Classes.

Inheritance in C++. The Graphics Hierarchy. The Graphics System. Safe Vectors. Ordered Lists. Polymorphism and Virtual Functions. Abstract Classes.

14. Heaps Binary Files and Bit Sets.

Array Based Binary Trees. Heaps. Implementing a Priority Queue. Binary Files. Bitsets. Case Study: Huffman Compression.

15. Recursive Algorithms.

Divide and Conquer Algorithms. Combinatorics. Dynamic Programming. Backtracking: The Eight-Queens Problem.

16. Graphs.

Graph Terminology. The Graph Class. Graph Class Design. Graph Traversal Algorithms. Graph Traversal Applications. Graph Minimization Algorithms.




This book is designed to present the fundamentals of data structures from an object-oriented perspective. The focus is on data structures that efficiently store large collections of data. The structures, called containers, feature operations to access, insert, and remove items from the collection. The study of data structures is core to a computer science curriculum. This curriculum has had a rich and storied tradition. Computer researchers and practitioners have evolved a wide range of container structures to meet different problem situations. Initially, the focus was on implementation issues so that programs could efficiently store and access large data sets within the limited physical resources of the computer system. As computers developed greater CPU power and increased memory and storage capabilities, researchers and practitioners were free to give more consideration to the abstract design of the containers. The efforts were greatly aided by an emerging emphasis on object-oriented programming. Object technology provides a means of viewing containers as objects with designated operations to handle the data. A class declaration defines the structure of a container. The public member functions describe a programming interface that allows a container to be used in applications.

Researchers at AT&T Bell Laboratories and Hewlett-Packard Research Labs combined the principles of generic and object-oriented programming to create a unified approach to the study of data structures and algorithms. The result is the Standard Template Library (STL), which is now part of the standard C++ library. STL provides a modern approach to data structures. It categories the structures as sequence and associative containers, along with adapter classes. By using templates rd iterators, the STL library allows a programmer to execute a broad range of algorithms that apply to each of the container classes.

This is, however, not a book on STL. It draws on the design structure of STL to date a unifying study of data structures. The reader will be introduced to the basics of STL and become familiar with the essential elements of the library. The result will be an appreciation of the power, simplicity, and usefulness of STL. With this background, the reader can easily read a technical book on STL to learn more of its many features. While this book is designed as a textbook, a computer professional could use it as a self-study guide to data structures.

Approach to Data Structures

This book uses a very careful and systematic approach in the development of each data structure. The reader first views a structure informally as an ADT that provides a description of how the container stores elements. Text, figures, and examples provide a detailed understanding of the key operations for the data structure, without reference to any implementation. The reader is then introduced to a second view of the structure using a formal C++ class declaration or an API. The latter refers to an Application Programming Interface format that is the industry-wide standard for presenting class operations. The API format includes the function prototype, a description of its action, and a listing of its preconditions and postconditions. We use the API format to describe the STL container classes and the class declaration to describe the other data structures that are developed in the book.

Once the reader is familiar with a formal representation of a data structure, the book provides a series of applications, which illustrate problem-solving situations that effectively use the structure. Having the reader understand the implementation of a data structure is a key feature of the book. Corresponding to each STL container class, the book presents a "mini Container" class that uses the STL interface but offers a straight forward implementation of the operations. The text clearly presents the design and coding of the key operations. The supplemental software supplies a complete listing of the class, with well-documented code.

Ins and Outs of the Book

This book assumes the reader has completed a first course in C++ object-oriented programming. The authors assume that the concepts of object composition, operator overloading, pointers and dynamic memory, and inheritance are covered briefly, if at all, in a first course. These concepts are carefully developed in this book in the context of their application to data structures. Periodically the book introduces only the essentials of a programming concept, and makes available a Web Tutorial that develops the concept in greater depth. The tutorials include examples and programs and provide the reader with enrichment that is not critical to understanding the text. The existence of a tutorial is clearly marked with an icon in the margin.

Chapters 1 through 10 cover sequence containers (array, vector, list, deque), the adapter classes (stacks, queues, and priority queues), and an introduction to associative tree containers. The material, along with a development of pointers, dynamic memory, and linked lists contains the topics usually covered in a first course in data structures (CS2).

Chapters 11 through 16 introduce more advanced containers that include sets, maps, balanced trees, heaps, hash tables and graphs. The chapters also include a study of applied searching and sorting algorithms, advanced recursion, and graph algorithms. The material is appropriate for a follow-up course in advanced data structures and applied algorithms (CS7).

Supplemental Resources

Readers may access the complete source code listings for all classes and programs in the book from the authors' website at http://www.uop.edu/fordtopp or http://www.fordtopp.com, and from Prentice Hall at http://www.prenhall.com. The C++ source code has been tested and run in the Windows environment using Microsoft Visual C++ and Borland C++ Builder, and in the UNIX environment using GNU C++. The graphics library is implemented in each of these environments.

To successfully compile and run the programs in the book using the Microsoft Visual C++,6.0 compiler, the reader must install the latest Service Pack. Instructions for obtaining and loading the service pack are available on the authors' and Prentice Hall web sites. The same sites include the Web tutorials and Powerpoint slides that present the key topics from each chapter.

An Instructor's Resource CD (IRCD) is available to instructors and provides answers to all of the written exercises and a solution to all of the programming exercises and programming projects. The IRCD also has sample tests with 'questions in a variety of formats. All of these elements are provided in Word for` mat (".doc") to enable the selection and modification of individual items. For printing only, the IRCD also supplies the materials in Acrobat Reader (".pdf") and postscript (".ps") format. In addition, it provides individual source files of all the programs (*.cpp) and classes (*.h) that are developed in the exercises. The IRCD is available upon request by Professors and Instructors from your local Prentice Hall sales representative.


The authors have been supported by friends, students, and colleagues throughout he preparation of the second edition of Data Structures with C++ using STL. The University of the Pacific has generously provided resources and support to complete the project. Prentice Hall offered a dedicated team of professionals who hand the book design and production. We are especially grateful to our acquisitions editor, Petra Recter and to the production editor, AudriAnna Bazlen. We also appreciate the efforts of Sara Burrows, assistant editor, who worked with us on the compilation of the supplements, and the work of Jennie Burger, who is doing the active marketing of the book.

Students have offered valuable criticism of the manuscript by giving us explicit feedback. Our reviewers offered guidance during the design of the new edition detailed comments on both the content and the pedagogical approach. We took most of their recommendations into account. Thanks go to Carol Roberts, University of Maine; Ken Bosworth, Idaho State University; Ralph Ewton, University of Texas, El Paso. Special thanks go to James Slack at Minnesota State University, Mankato, who made extensive and detailed suggestions. His insights and support were invaluable to the authors and greatly improved the final design and content of the book.

William Ford
William Topp


Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020