← Reader
Edit Roadmap
Title
Subtitle
Phases
1
Foundations
2
Trees & Graphs
3
DP & Problem Solving
4
Advanced Mastery
+ Add Phase
Export JSON
Download .json
Phase 1: Foundations
Label
Week Range
Title
Summary
Build every core data structure from scratch in Rust. Linear structures force you to master Box<T> and ownership. Hash structures teach you to fuse data structures for O(1) operations. Trees introduce recursive enums and Rc<RefCell<T>>. Every implementation fights the borrow checker — and that's the point.
Exit Criteria
Resources (4)
+ Add Resource
#1
Remove
Type
book
course
video
tool
wiki
paper
rfc
link
Priority (1-5)
1
2
3
4
5
Tag
Title
Author
Free
URL
Note
Primary reference for ownership, Box<T>, Rc<RefCell<T>>, and trait patterns used in every structure.
#2
Remove
Type
book
course
video
tool
wiki
paper
rfc
link
Priority (1-5)
1
2
3
4
5
Tag
Title
Author
Free
URL
Note
Canonical resource explaining why linked lists in Rust require Rc<RefCell<T>>. Read alongside Days 3–4.
#3
Remove
Type
book
course
video
tool
wiki
paper
rfc
link
Priority (1-5)
1
2
3
4
5
Tag
Title
Author
Free
URL
Note
Step-by-step animations for every structure in Month 1. Watch the animation before implementing.
#4
Remove
Type
book
course
video
tool
wiki
paper
rfc
link
Priority (1-5)
1
2
3
4
5
Tag
Title
Author
Free
URL
Note
After implementing each structure, read the standard library source. BTreeMap uses Red-Black Tree. VecDeque is a circular buffer.