find interval TODO: use augmented tree's 'max' to efficiently bail out early
find minimum valued Node (interval)
find interval(s) overlapping given interval
find interval by exact key -- NOT overlap
insert interval, updating "max" on the way down
iterator functions: next
iterator functions: reset
remove interval