12. YSC2229 Lecture Notes, Week 12

• 12.1. Representing Sets via Binary Search Trees
  • 12.1.1. A Data Structure for Binary-Search Trees
  • 12.1.2. Inserting an element into a BST
  • 12.1.3. Binary-Search-Tree Invariant
  • 12.1.4. Testing Tree Operations
  • 12.1.5. Printing a Tree
  • 12.1.6. Searching Elements
  • 12.1.7. Tree Traversals
  • 12.1.8. Testing Element Retrieval and Tree Traversals
  • 12.1.9. More BST operations
  • 12.1.10. Deleting a node from BST
• 12.2. Representing Graphs
  • 12.2.1. Graphs as Adjacency Lists
  • 12.2.2. Reading and Printing Graphs
  • 12.2.3. Rendering Graphs via GraphViz
  • 12.2.4. Shortcomings of Adjacency-List graph representation
  • 12.2.5. Graphs as Linked Data Structures
  • 12.2.6. Switching between graph representations
  • 12.2.7. Testing graph operations
• 12.3. Exercises
  • 12.3.1. Mandatory exercises
  • 12.3.2. Recommended exercises
  • 12.3.3. Exercise 1
  • 12.3.4. Exercise 2
  • 12.3.5. Exercise 3
  • 12.3.6. Exercise 4

Supplementary materials

• Binary Search Trees
• Graph Definitions
• Automated Tests