Welcome!

Welcome to the Data Structures and Algorithms with Python text by Kent D. Lee and Steve Hubbard. This is the supplementary materials website. You can download programs and other files mentioned in the text from this website. The chapters are listed below along with a short description of each chapter and the supplementary materials available for each chapter.

Instructor only materials are available by contacting Kent at kentdlee@luther.edu. You must provide proof that you are an instructor to get access to the instructor materials.

Contents

• 1. Python Programming 101
  • 1.1. The Dog Class
  • 1.2. The Variable Length Records Draw Program
  • 1.3. The Final XML Draw Program
  • 1.4. Figures from Text
• 2. Computational Complexity
  • 2.1. The PlotData Program
  • 2.2. List Access Timing
  • 2.3. The PyList Datatype
  • 2.4. Figures from Text
• 3. Recursion
  • 3.1. Scope
  • 3.2. Recursive Spiral
  • 3.3. Sunflower Program
  • 3.4. Figures from Text
• 4. Sequences
  • 4.1. The PyList Datatype
  • 4.2. The Sort Animation
  • 4.3. Tic Tac Toe
  • 4.4. The Linked List Datatype
  • 4.5. The Stack Datatype
  • 4.6. The Queue Datatype
  • 4.7. Figures from Text
• 5. Sets and Maps
  • 5.1. The HashSet Datatype
  • 5.2. The HashMap Datatype
  • 5.3. Sudoku Puzzles
  • 5.4. Figures from Text
• 6. Trees
  • 6.1. Abstract Syntax Trees
  • 6.2. Binary Search Trees
  • 6.3. Sudoku Test Files
  • 6.4. OrderedTreeSet
  • 6.5. OrderedTreeSet Test Program
  • 6.6. Figures from Text
• 7. Graphs
  • 7.1. Drawing Graphs
  • 7.2. Figures from Text
• 8. Membership Structures
  • 8.1. An English Dictionary
  • 8.2. Figures from Text
• 9. Heaps
  • 9.1. Heap Program
  • 9.2. Figures from Text
• 10. Balanced Binary Search Trees
  • 10.1. AVL Tree Implementations
    • 10.1.1. Iteratively Implemented AVL Tree
    • 10.1.2. Recursively Implemented AVL Tree
  • 10.2. Splay Tree Implementations
    • 10.2.1. Iteratively Implemented Splay Tree
    • 10.2.2. Recursively Implemented Splay Tree
  • 10.3. Figures from Text
• 11. B-Trees
  • 11.1. Relational Database Tables
  • 11.2. The Inefficient Join Program
  • 11.3. B-Tree Implementations
    • 11.3.1. Iterative B-Tree
    • 11.3.2. Recursive B-Tree
  • 11.4. Sample Output from Join
  • 11.5. Figures from Text
• 12. Heuristic Search
  • 12.1. Searching Mazes
  • 12.2. N-Queens Problem
  • 12.3. Connect Four
  • 12.4. Figures from Text