Product Description
Chapter 1 - Bags
Chapter 2 - Bag Implementations That Use Arrays
Chapter 3 - A Bag Implementation That Links Data
Chapter 4 - The Efficiency Of Algorithms
Chapter 5 - Stacks
Chapter 6 - Stack Implementations
Chapter 7 - Queues, Deques, And Priority Queues
Chapter 8 - Queue, Deque, And Priority Queue Implementations
Chapter 9 - Recursion
Chapter 10 - Lists
Chapter 11 - A List Implementation That Uses An Array
Chapter 12 - A List Implementation That Links Data
Chapter 13 - Iterators For The Adt List
Chapter 14 - Problem Solving With Recursion
Chapter 15 - In Introduction To Sorting
Chapter 16 - Faster Sorting Methods
Chapter 17 - Sorted Lists
Chapter 18 - Inheritance And Lists
Chapter 19 - Searching
Chapter 20 - Dictionaries
Chapter 21 - Dictionary Implementations
Chapter 22 - Introducing Hashing
Chapter 23 - Hashing As A Dictionary Implementation
Chapter 24 - Trees
Chapter 25 - Tree Implementations
Chapter 26 - A Binary Search Tree Implementation
Chapter 27 - A Heap Implementation
Chapter 28 - Balanced Search Trees
Chapter 29 - Graphs
Chapter 30 - Graph Implementations