C++ Data Structures: A Laboratory Course, Third Edition

All worksheet pages and appendix material are available online for instructors and students to utilize and print as needed.

More sophisticated use of templates is presented. Template specialization is introduced in the Expression Tree. Default template types and template template parameters are introduced in the Heap.

Lab order has been changed to be compatible with the order in most current textbooks. 

Each laboratory consists of three parts: basic implementation and testing, programming exercises, and analysis exercises. The basic implementation section explains the specific ADT, introduces the new C++ concepts, describes the ADT's properties, explains implementation details, and guides you through testing your implementation. In the three programming exercises, the first exercises is usually to apply or extend the concepts introduced in the basic implementation. The analysis exercise urges students to analyze a data structure in terms of its efficiency or use.

Laboratory 1  Text ADT    

Laboratory 2  BlogEntry ADT

Laboratory 3  Array implementation of the List ADT 

Laboratory 4  Ordered List ADT    

Laboratory 5  Singly linked list implementation of the List ADT 

Laboratory 6  Stack ADT

Laboratory 7  Queue ADT

Laboratory 8 Expression Tree ADT           

Laboratory 9 Binary Search Tree ADT 

Laboratory 10 Hash Table ADT        

Laboratory 12 Weighted Graph ADT 

Laboratory 13 Performance Evaluation

• Complete Worksheets_PDF
• Complete Worksheets_WordFiles
• Student Resource Files