Geometry of binary search trees

In computer science, one approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting a set of points in the plane with as few additional points as possible to avoid rectangles with only two points on their boundary. == Access sequences and competitive ratio == As typically formulated, the online binary search tree problem involves search trees defined over a fixed key set { 1 , 2 , .

Source: Wikipedia — Geometry of binary search trees (CC BY-SA 4.0)