Data structures, algorithms, and object-oriented programming / Gregory L. Heileman.

PART ONE : FUNDAMENTALS
1 Background
1.1 Abstract data types
1.2 Pueudocode
1.3 A model of computer memory
Exercises
Chapter notes

2 Algorithms
2.1 Efficiency of algorithms
2.2 Algorithmic analysis
2.3 Algorithmic techniques
Exercises
Chapter notes

3 Data structure and C programs
3,1 The pre-processor
3.2 Variable and storage classes
3.3 Pointers
Exercises
Chapter notes
etc

4 Object oriented programming and C++
4.1 Fundamental concepts
4.2 The C++ programming and polymorphism
4.3 A extended example : Matrix ADT implementation in C++
Exercises
Chapter notes

PART 11 BASIC DATA STRUCTURE
5 Lists
5.1 The list ADT
5.2 Sequential mapping
5.3 Linked lists
Exercises
Chapter notes

6 Stacks and Queues
6.1 The stack and queue ADTs
6.2 Stacks and expression evaluation
6.3 Stacks and recursion
Exercises
Chapter notes

7. Binary search trees
7.1 Definitions
7.2 Dynamic set operation
7.3 Binary search tree implementation
Exercises
Chapter notes

8. Hashing
8.1 Hash tables
8.2 Hash functions
8.3 Collision resolution strategies
Exercises
Chapter notes

9 Priority queues
9.1 The priority queues ADT
9.2 Balanced trees
9.3 Binary heaps
Exercises
Chapter notes

PART THREE : ADVANCEED DATA STRUCTURE
10 Amortized analysis
10.1 An overview
10.2 Accounting method
10.3 Potential method
Exercises
Chapter notes

11, Balanced search trees
11.1 Rotation
11.2 AVL trees
11.3 Red balck trees
Exercises
Chapter notes

12 : Heaps
12.1 Meldable priority queue ADT
12.2 Non amortized data structure
12.3 Amortized data structure
Exercises
Chapter notes

13 Dynamic sets special operations
13.1 Range searching
13.2 Multidimentianal searching
13.3 The disjoint set ADT
13.4 An extended example

14 Graphs
14.1 Graph problems
14.2 Graph representation
14.3 Basic search techniques
Exercises
Chapter notes

Includes bibliographical : p.433-438 and index : p.439-446