The algorithm does not need to maintain explicitly a representation of the sweep line L or its position in the plane.
The binary search tree may be any balanced binary search tree data structure, such as a red-black tree; all that is required is that insertions, deletions, and searches take logarithmic time.