Link-Cut trees use space:
- nodes, each with constant fields
- No edge storage needed (edges implicit in parent pointers)
- Lazy flags and aggregates add constant overhead per node
Compare to other structures:
- HLD: with segment trees included
- Euler tour: for tour, segment tree adds
- Link-Cut: total
Link-Cut trees are space-efficient despite their power.