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
Parents
725
1–5 of 725
1.5K
9
h-index
9
h-index
8
h-index
7
h-index
6
h-index
1–5 of 1.5K
642

Centre National de la Recherche Scientifique
Paris, France
18 h-index
39 publications
2.1K citations
Carnegie Mellon University
Pittsburgh, United States
14 h-index
34 publications
2.5K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
13 h-index
27 publications
2.1K citations
University of California, Berkeley
Berkeley, United States
13 h-index
17 publications
1.6K citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
16 publications
2K citations

University of Waterloo
Waterloo, Canada
12 h-index
14 publications
655 citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
15 publications
462 citations
University of Washington
Seattle, United States
10 h-index
14 publications
904 citations
1–8 of 642
24 publications · 1.6K citations
17
h-index
18 publications · 1K citations
16
h-index
16 publications · 1.3K citations
15
h-index
Repository · 15 publications · 329 citations
13
h-index
TPDS · 13 publications · 645 citations
12
h-index
1–5