CMPT 435L – Data Structures and Algorithms

---

Course Information

This repository contains assignments and project submissions for CMPT 435L – Data Structures and Algorithms.
All work in this repository reflects my solutions and understanding of course material.

Assignments

• Assignment 1: hello_world — basic Rust project setup / “hello world” starter.
• Assignment 2: simple_bfs — a simple breadth-first search (BFS) traversal example.
• Assignment 3: self_balancing_bst — self-balancing BST work (tree rotations / balancing logic).
• Assignment 4: dfs_edge_classification — depth-first search (DFS) with edge classification.
• Assignment 5: a_star — A* pathfinding plus supporting custom generic data structure implementations (graph/priority queue/etc).

(This list will be updated as assignments are completed and submitted.)

---

Running the subprojects

Each assignment is implemented as its own Rust crate (each folder has its own Cargo.toml).

• Run:

cd <subproject>
cargo run

• Example:

cd hello_world && cargo run

---

Academic integrity / disclaimer

• Do not copy: This repository is provided for reference only.
• Write your own solution: If you're a student in this course (or a similar course), do your own work and follow your instructor’s collaboration/academic integrity policy.
• Use responsibly: You may use this to understand concepts, but do not submit any of this code as your own.

---