Question summary
Preserve buffered tombstones through splits and merges, and support concurrent lookup, mutation, and ordered iteration.
SysRound summarized the public source. Check the source for the full requirements.
Related questions
Continue with questions that share topics or the same question type.
- Build a concurrent database buffer pool
Practical engineering
- Count Machines and Recover a Distributed Tree Topology
Practical engineering · Distributed Transactions & Idempotency · Fault Tolerance & Failover
- Debug a Concurrent Job Scheduler
Practical engineering · Concurrency · Debugging
- Design a Dependency-Aware Concurrent Tool Scheduler
Practical engineering · Concurrency · Job Scheduling & Workflows
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Carnegie Mellon University · 1 record
No company association
Course exercise
Implement a concurrent B+ tree with deferred deletion
Source updated: Nov 11, 2026
Source snapshot: Nov 13, 2026
Original short summary and source link; do not assume the page has the starter-code license.
View source