augmenting-data-structures

What problem does it solve?

Designing robust augmented data structures requires careful selection of a base structure, local metadata maintenance, and formal proofs that mutations preserve invariants.

Core Features & Use Cases

• Guided design of augmented red-black trees, interval trees, and order-statistic containers.
• Clear mutation rules that ensure local metadata updates during rotations, insertions, and deletions.
• Production-conscious guidance on when to choose custom augmentation vs library-backed solutions, with risk considerations and proof checklists.

Quick Start

Define a base tree, specify local metadata, and outline how insert and rotate operations update it.