Geometry of binary search trees
id:
geometry-of-binary-search-trees-253-3309751
title:
Geometry of binary search trees
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Geometry_of_binary_search_trees
date created:
date modified:
2023-11-28T18:27:54Z
main entity:
{"identifier":"Q17016415","url":"https://www.wikidata.org/entity/Q17016415"}
image:
fields total:
13
integrity:
13