| dbp:reason
|
- it's not explained what internal and leaf nodes of the binary search tree represent. How are line segments compared to each other, while inserting, deleting or finding the predecessor or successor of a line segment? What makes a line segment the predecessor and successor of another line segment? (en)
- It may not be easy to visualize this concept without a simple animation, unless you already know the algorithm. (en)
|
