Live briefing
Everything about 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. Wikipedia â
đ§ Start here: a 6-step reading path
- Read the overview: Geometry of binary search treesA 5-minute orientation
- Pick up a classic book: Introduction to AlgorithmsThe most-reprinted book on the subject
- Go sideways: Optimal binary search treeA closely related topic
- Go sideways: Interleave lower boundA closely related topic
đ Definitions
No dictionary entry for this exact phrase.
đ Landmark papers (most cited)
- No matching papers found.
đ Books worth reading
Introduction to AlgorithmsThomas H. Cormen, Charles E. Leiserson ¡ 1990
Algorithm designMichael T. Goodrich, Roberto Tamassia ¡ 2001
Algorithm Design and ApplicationsMichael T. Goodrich, Roberto Tamassia ¡ 2014
Intelligent Science and Intelligent Data EngineeringJian Yang ¡ 2013
āĻĒā§āĻ°ā§āĻā§āĻ°āĻžāĻŽāĻŋāĻ āĻāĻ¨āĻā§āĻ¸ā§āĻāĻŽā§āĻ āĻŽāĻžāĻšāĻŦā§āĻŦā§āĻ˛ āĻšāĻžāĻ¸āĻžāĻ¨ ¡ 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đ Related topics
- Optimal binary search tree In computer science, an optimal binary search tree, or optimal BST, sometimes called a weight-balanced binary tree, is a binary search tree which providesâĻ
- Interleave lower bound In the theory of optimal binary search trees, the interleave lower bound is a lower bound on the number of operations required by a Binary Search TreeâĻ
- Finger search In computer science, a finger search on a data structure is an extension of any search operation that structure supports, where a reference (finger) toâĻ
- Treap In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintainâĻ
- Splay tree A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binaryâĻ
- Rectangulations In discrete mathematics, a rectangulation (or mosaic floorplan) â is a decomposition of a rectangle into finitely many interior-disjoint rectangles. TheâĻ
- Binary search tree In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of eachâĻ
- Cartesian tree In computer science, a Cartesian tree is a binary tree derived from a sequence of distinct numbers. To construct the Cartesian tree, set its root to beâĻ