Binary Trees

Binary Tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child, thereby enabling efficient representation and traversal of ordered or hierarchical data.

725

Publications

38.4K

Citations

1.5K

Authors

642

Institutions

Publications per year

2017–2026

84

Variants

Binary Tree

Authors

1.5K

  1. JM
    Jean Marcel Pallo

    Université de Bourgogne, France

    9 publications · 333 citations

    9

    h-index

  2. PS
    Philippe Salembier

    Universitat Politècnica de Catalunya, Spain

    9 publications · 945 citations

    9

    h-index

  3. FR
    Frank Ruskey

    University of Victoria, Canada

    8 publications · 449 citations

    8

    h-index

  4. MS
    Mike Steel

    University of Canterbury, New Zealand

    7 publications · 140 citations

    7

    h-index

  5. AL
    Arnold L. Rosenberg

    University of Massachusetts Amherst, United States

    6 publications · 432 citations

    6

    h-index

1–5 of 1.5K

Venues

  1. Information Processing Letters

    24 publications · 1.6K citations

    17

    h-index

  2. IEEE Transactions on Computers

    18 publications · 1K citations

    16

    h-index

  3. SIAM Journal on Computing

    16 publications · 1.3K citations

    15

    h-index

  4. arXiv (Cornell University)

    Repository · 15 publications · 329 citations

    13

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 13 publications · 645 citations

    12

    h-index

1–5