Consider a segment tree with range [0,...,k], where k is an
integer.
(a) Describe how a horizontal line segment with end points in the
range [0,...,k] is deleted from a segment tree. What is the time
complexity? Show how you derived this complexity.
(b) Let N be the set of nodes of a segment tree in which
an interval [i, j] is stored. Prove that N does not contain 3 nodes
that are at the same level. ( Must prove for the general
cases)