837 B
837 B
Outline
- Write a red-black tree with rebalancing
- Assignment: start on the red-black tree (moved to 2026.07.01)
- Requirement: you must use the left- and right-rotation code in the previous assignment
- You may change the code to fit the class
- Next week: introduce graphs and graph algorithms
Git reference
There are two repositories to keep track of:
To submit homework, add all new files and changes to your code:
git add .
Commit with a message:
git commit -m "Hello World"
Push changes:
git push
To pull new changes to the notes and sample code, run this in the dsa-tutoring directory:
git pull