All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
Binary tree
Known as:
Left child
, Bifurcating arborescence
, Perfect binary tree
Â
(More)
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and…Â
(More)
Wikipedia
Topic mentions per year
Topic mentions per year
1965-2017
0
100
200
1965
2017
Related topics
Related topics
50 relations
AA tree
Array data structure
B-tree
Binary expression tree
(More)
Related mentions per year
Related mentions per year
1937-2018
1940
1960
1980
2000
2020
Binary tree
Computer science
Search algorithm
Set theory
Graph theory
Collision detection
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Binary tree of SVM: a new fast multiclass training and classification algorithm
B. Fei
,
Jinbai Liu
IEEE Transactions on Neural Networks
2006
We present a new architecture named Binary Tree of support vector machine (SVM), or BTS, in order to achieve high classification…Â
(More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Cache oblivious search trees via binary trees of small height
Gerth Stølting Brodal
,
Rolf Fagerberg
,
Riko Jacob
SODA
2002
We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach…Â
(More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
B*-Trees: a new representation for non-slicing floorplans
Yun-Chih Chang
,
Yao-Wen Chang
,
Guang-Ming Wu
,
Shu-Wei Wu
DAC
2000
We present in this paper an efficient, flexible, and effective data structure, <italic>B<supscrpt>*</supscrpt>-trees</italic> for…Â
(More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Hopf Algebra of the Planar Binary Trees
Jean-Louis Loday
,
O. Ronco
1997
is a sub-Hopf algebra. There is a basis Qn of Soln such that the composite map k[Qn]&Soln k[Sn] has the following property: its…Â
(More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The context-tree weighting method: basic properties
Frans M. J. Willems
,
Yuri M. Shtarkov
,
Tjalling J. Tjalkens
IEEE Trans. Information Theory
1995
We describe a sequential universal data compression procedure for binary tree sources that performs the " double mixture. " Using…Â
(More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree
Thilo Hafer
,
Wolfgang Thomas
ICALP
1987
In this paper we study the expressive power of the full branching time logic CTL* (of Clarke, Emerson, Halpern and Sistla), by…Â
(More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Set operations on polyhedra using binary space partitioning trees
William C. Thibault
,
Bruce F. Naylor
SIGGRAPH
1987
We introduce a new representation for polyhedra by showing how Binary Space Partitioning Trees (BSP trees) can be used to…Â
(More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
Naofumi Takagi
,
Hiroto Yasuura
,
Shuzo Yajima
IEEE Transactions on Computers
1985
A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer…Â
(More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The Average Height of Binary Trees and Other Simple Trees
Philippe Flajolet
,
Andrew M. Odlyzko
J. Comput. Syst. Sci.
1982
The average height of a binary tree with n internal nodes is shown to be asymptotic to 2 6. This represents the average stack…Â
(More)
Is this relevant?
Highly Cited
1972
Highly Cited
1972
Symmetric binary B-Trees: Data structure and maintenance algorithms
Rudolf Bayer
Acta Informatica
1972
A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keys…Â
(More)
Is this relevant?