Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Geometry of binary search trees
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, one approach to the <a href="/facts/Dynamic_optimality/ESfe6hoL">dynamic optimality</a> problem on <a href="/facts/Online_algorithm/64TsU7Yz">online algorithms</a> for <a href="/facts/Binary_search_tree/gWubNt7b">binary search trees</a> 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. </p>