{"version":"1.0","type":"link","title":"Geometry of binary search trees - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}