Binary Search Trees

Binary Search Trees is a binary tree data structure in which each node has at most two children and satisfies the binary search property, where the left subtree of a node contains only nodes with keys less than the node’s key and the right subtree contains only nodes with keys greater than the node’s key, enabling efficient search, insertion, and deletion operations.

436

Publications

30.1K

Citations

801

Authors

406

Institutions

Publications per year

2017–2026

51

Variants

Binary Search TreeBst

Authors

801

  1. LD
    Luc Devroye

    McGill University, Canada

    8 publications · 477 citations

    8

    h-index

  2. HH
    Hsien‐Kuei Hwang

    Institute of Statistical Science, Academia Sinica, Taiwan

    6 publications · 176 citations

    6

    h-index

  3. HM
    Hosam M. Mahmoud

    George Washington University, United States

    6 publications · 139 citations

    6

    h-index

  4. RE
    Robert E. Tarjan

    Princeton University, United States

    6 publications · 1.9K citations

    6

    h-index

  5. RN
    Ralph Neininger

    Goethe University Frankfurt, Germany

    6 publications · 258 citations

    6

    h-index

1–5 of 801

Venues

  1. Communications of the ACM

    14 publications · 8.3K citations

    13

    h-index

  2. Information Processing Letters

    14 publications · 328 citations

    12

    h-index

  3. Theoretical Computer Science

    12 publications · 462 citations

    11

    h-index

  4. Acta Informatica

    11 publications · 949 citations

    11

    h-index

  5. SIAM Journal on Computing

    10 publications · 863 citations

    10

    h-index

1–5