CMU 15-445 Fall 2025 Project #2: B+Tree (BusTub)

Build a thread-safe B+ tree with insertion, deletion with splits and merges, point search and an ordered iterator on top of the buffer pool.

Not attemptedCMU 15-445Access: free

Open resource

The exercise happens on CMU 15-445. Canonical link: https://15445.courses.cs.cmu.edu/fall2025/project2/. Link check: link responded (5 Oct 2026). Opened from this app 0 times; opening is not counted as an attempt.

Supports: Index internals and latch-based concurrency for storage, low-level and database research roles; builds on Project #1.

Record an attempt

OutcomeAttempted, not solvedSolved with help (hints, editorial or discussion)Solved independentlyReviewed an earlier solution

Date

Minutes (optional)

Language

Hints used

Confidence afterwards

Main mistake

Learning objective this practices (optional)

Notes (approach, bug, what to remember)

Re-attempt on (optional)

A date is suggested from the outcome.

Attempt history

No attempts recorded yet.