Data Structures
Segment Trees:Range Queries Without Rescanning the Array
A segment tree stores aggregates of array ranges in a binary tree of intervals. Point update and range query in O(log n) without walking the whole slice each time.
Read More1 post(s)