baryluk/ral — Issue #2: Implement min-list
Author: baryluk
Created: 2011-10-31 05:32:43+00:00
State: open

ral can be extended to support min operation in O(1), without secrefasing any other operations. Just keep minimal value (and optionally index or other supporting data) of given tree in root of each tree, then just take minimum of this roots. Updating roots (and elements from leavs to root) takes logarithmic times, as well examing them all.

Implement it.