最終更新日：2022/12/24
Since the extreme points are sorted in an ascending order, and it is known that there is no more event other than the event at the current leftmost extreme point, and therefore we traverse from the root of the tree to the bottom while we re-evaluating the new interval values of each node and testing the inclusion of the extreme point in the interval.
音声機能が動作しない場合はこちらをご確認ください
編集履歴（0）
元となった例文
Since
the
extreme
points
are
sorted
in
an
ascending
order,
and
it
is
known
that
there
is
no
more
event
other
than
the
event
at
the
current
leftmost
extreme
point,
and
therefore
we
traverse
from
the
root
of
the
tree
to
the
bottom
while
we
re-evaluating
the
new
interval
values
of
each
node
and
testing
the
inclusion
of
the
extreme
point
in
the
interval.
