CS101: Introduction to Algorithms
priority_high
High Priority
Implement Red-Black Tree Rotation Logic
Deadline
calendar_today
Oct 24, 2024 • 11:59 PM
Status
pending_actions
In Progress
Description
Complete the implementation of left and right rotations for the Red-Black Tree data structure. Ensure that the property of the tree is maintained after every insertion.
Review the lecture notes from Monday regarding balance factors and recoloring rules. Unit tests must pass for both standard and edge cases (empty tree, duplicate nodes).
Subtasks
2 / 4 Completed
check
Review balance rules
check
Draft pseudocode
Write rotation functions
Verify with unit tests
Resources
description
Lecture_Notes.pdf
link
GitHub Repo