The geometry of binary search trees

Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Pǎtraşcu

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Using this correspondence, we achieve the following results: 1. A surprisingly clean restatement in geometric terms of many results and conjectures relating to BSTs and dynamic optimality. 2. A new lower bound for searching in the BST model, which subsumes the previous two known bounds of Wilber [FOCS'86]. 3. The first proposal for dynamic optimality not based on splay trees. A natural greedy but offline algorithm was presented by Lucas [1988], and independently by Munro [2000], and was conjectured to be an (additive) approximation of the best binary search tree. We show that there exists an equal-cost online algorithm, transforming the conjecture of Lucas and Munro into the conjecture that the greedy algorithm is dynamically optimal.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms
    Pages496-505
    Number of pages10
    StatePublished - 2009
    Event20th Annual ACM-SIAM Symposium on Discrete Algorithms - New York, NY, United States
    Duration: Jan 4 2009Jan 6 2009

    Other

    Other20th Annual ACM-SIAM Symposium on Discrete Algorithms
    CountryUnited States
    CityNew York, NY
    Period1/4/091/6/09

    Fingerprint

    Binary Search Tree
    Geometry
    Optimality
    Online Algorithms
    Greedy Algorithm
    Correspondence
    Lower bound
    Costs
    Term
    Approximation

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

    Cite this

    Demaine, E. D., Harmon, D., Iacono, J., Kane, D., & Pǎtraşcu, M. (2009). The geometry of binary search trees. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 496-505)

    The geometry of binary search trees. / Demaine, Erik D.; Harmon, Dion; Iacono, John; Kane, Daniel; Pǎtraşcu, Mihai.

    Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. p. 496-505.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Demaine, ED, Harmon, D, Iacono, J, Kane, D & Pǎtraşcu, M 2009, The geometry of binary search trees. in Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 496-505, 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, NY, United States, 1/4/09.
    Demaine ED, Harmon D, Iacono J, Kane D, Pǎtraşcu M. The geometry of binary search trees. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. p. 496-505
    Demaine, Erik D. ; Harmon, Dion ; Iacono, John ; Kane, Daniel ; Pǎtraşcu, Mihai. / The geometry of binary search trees. Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. pp. 496-505
    @inproceedings{de2fc9d63ff54e69b34ea1d269e10eba,
    title = "The geometry of binary search trees",
    abstract = "We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Using this correspondence, we achieve the following results: 1. A surprisingly clean restatement in geometric terms of many results and conjectures relating to BSTs and dynamic optimality. 2. A new lower bound for searching in the BST model, which subsumes the previous two known bounds of Wilber [FOCS'86]. 3. The first proposal for dynamic optimality not based on splay trees. A natural greedy but offline algorithm was presented by Lucas [1988], and independently by Munro [2000], and was conjectured to be an (additive) approximation of the best binary search tree. We show that there exists an equal-cost online algorithm, transforming the conjecture of Lucas and Munro into the conjecture that the greedy algorithm is dynamically optimal.",
    author = "Demaine, {Erik D.} and Dion Harmon and John Iacono and Daniel Kane and Mihai Pǎtraşcu",
    year = "2009",
    language = "English (US)",
    isbn = "9780898716801",
    pages = "496--505",
    booktitle = "Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms",

    }

    TY - GEN

    T1 - The geometry of binary search trees

    AU - Demaine, Erik D.

    AU - Harmon, Dion

    AU - Iacono, John

    AU - Kane, Daniel

    AU - Pǎtraşcu, Mihai

    PY - 2009

    Y1 - 2009

    N2 - We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Using this correspondence, we achieve the following results: 1. A surprisingly clean restatement in geometric terms of many results and conjectures relating to BSTs and dynamic optimality. 2. A new lower bound for searching in the BST model, which subsumes the previous two known bounds of Wilber [FOCS'86]. 3. The first proposal for dynamic optimality not based on splay trees. A natural greedy but offline algorithm was presented by Lucas [1988], and independently by Munro [2000], and was conjectured to be an (additive) approximation of the best binary search tree. We show that there exists an equal-cost online algorithm, transforming the conjecture of Lucas and Munro into the conjecture that the greedy algorithm is dynamically optimal.

    AB - We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Using this correspondence, we achieve the following results: 1. A surprisingly clean restatement in geometric terms of many results and conjectures relating to BSTs and dynamic optimality. 2. A new lower bound for searching in the BST model, which subsumes the previous two known bounds of Wilber [FOCS'86]. 3. The first proposal for dynamic optimality not based on splay trees. A natural greedy but offline algorithm was presented by Lucas [1988], and independently by Munro [2000], and was conjectured to be an (additive) approximation of the best binary search tree. We show that there exists an equal-cost online algorithm, transforming the conjecture of Lucas and Munro into the conjecture that the greedy algorithm is dynamically optimal.

    UR - http://www.scopus.com/inward/record.url?scp=70349130339&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=70349130339&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 9780898716801

    SP - 496

    EP - 505

    BT - Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms

    ER -