CSSE 230: Session Notes - Day 24

Topics

1. Tree shapes
2. Complexity proofs for graph algorithms
3. Prompt engineering

Outline

1. [5 min] Contact before work
2. [10 min] Tree shapes and influence on iterator performance.
3. [20 min] Runtime proofs for graph algorithms: two proofs for Dijkstra's algorithm.
4. [15 min] Prompt engineering

Resources

• Tree shapes, of trees with 200 elements.
  • BST
  • AVL
  • AA