5 docs tagged with "segment trees"

Heavy-Light Decomposition breaks a tree into chains so that path queries and updates can be answered in O(log^2 n) using a Segment Tree.

A Persistent Segment Tree keeps every previous version of itself accessible after an update, enabling efficient queries on historical states of an array.

A curated list of practice problems to enhance your understanding and skills in using segment trees.

Segment Trees are used for efficient range queries.

In this blog post, we'll explore Segment Trees, a powerful data structure for efficiently solving range query problems.