Most books on data structures are filled with so many technical details (and lack thorough explanations) that the reading becomes difficult. This accessible, conversational presentation explores data structures concepts in clear language. Assumes a basic knowledge of C++. Focuses on the client for all programs, classes, and data structures. Offers meaningful, relevant examples and worked examples throughout. Includes thoroughly tested code. Provides code for all examples. A useful reference for anyone interested in learning more about programming.

This book is intended for use in a traditional college- level data structures course (commonly known as CS2). This book assumes that students have learned the basic syntax of Python and been exposed to the use of existing classes. Most traditional CS1 courses that use Python will have covered all the necessary topics, and some may have covered a few of the topics covered in this book. We have found that most students successfully completing a CS1 course know how to use classes, but many of them need more experience to learn how to design and write their own classes. We address this issue by including a number of examples of class design in the first few chapters of this book.

Decker and Hirshfield's Working Classes applies the C++ programming language to the study of data structures and abstract data types. The authors organize their discussion of abstract data types according to their structural restrictions beginning with highly structured lists, stacks, and queues, and progressing through trees and directed graphs to unstructured sets. Chapter 10 examines the problem of regenerating text from a large sample, using a real computer/compiler system to demonstrate how time and space constraints arise from the choice of data structure. The book teaches by example (with more than 350 exercises provided), and most chapters conclude with an optional Explorations section that covers topics of special interest.

The latest book from Cengage Learning on Data Structures Using C++, International Edition

This title shows the process of cleaning code. Rather than just illustrating the end result, or just the starting and ending state, the author shows how several dozen seemingly small code changes can positively impact the performance and maintainability of an application code base.

An updated, innovative approach to data structures and algorithms Written by an author team of experts in their fields, this authoritative guide demystifies even the most difficult mathematical concepts so that you can gain a clear understanding of data structures and algorithms in C++. The unparalleled author team incorporates the object-oriented design paradigm using C++ as the implementation language, while also providing intuition and analysis of fundamental algorithms. Offers a unique multimedia format for learning the fundamentals of data structures and algorithms Allows you to visualize key analytic concepts, learn about the most recent insights in the field, and do data structure design Provides clear approaches for developing programs Features a clear, easy-to-understand writing style that breaks down even the most difficult mathematical concepts Building on the success of the first edition, this new version offers you an innovative approach to fundamental data structures and algorithms.

Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.

This book takes a minimalist approach to the traditional data structures course. It covers only those topics that are absolutely essential; the more esoteric structures and algorithms are left for later study. Suitable for an introductory data structures course or self-study, this book is written from the ground up in C++ (not translated from a Java-based text), and uses features of the C++ Standard Template Library to illustrate important concepts. A unique feature of the text is its use of literate programming techniques (originally developed by Donald Knuth) to present the sample code in a way that keeps the code from overwhelming the accompanying explanations. This book is suitable for an undergraduate data structures course using C++ or for developers needing review. Features • Takes a “minimalist” approach to the material that presents only essential concepts. This enables readers to focus on (and remember) just what they’ll need. • Uses select features of the C++11 standard to simplify the sample code and make it easier to understand. • Connects the concepts directly to the classes provided the Standard Template Library (STL), and shows how these classes can be implemented in C++. • Uses “literate programming” techniques that allow the presentation of the sample code to more clearly show the details of the code as well as how the pieces fit together.

Thes book has three key features : fundamental data structures and algorithms; algorithm analysis in terms of Big-O running time in introducied early and applied throught; pytohn is used to facilitates the success in using and mastering data strucutes and algorithms.