Binary tree

Known as: Left child, Bifurcating arborescence, Perfect binary tree 
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
010020019652017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
We present a new architecture named Binary Tree of support vector machine (SVM), or BTS, in order to achieve high classification… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present in this paper an efficient, flexible, and effective data structure, <italic>B<supscrpt>*</supscrpt>-trees</italic> for… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
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)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We describe a sequential universal data compression procedure for binary tree sources that performs the " double mixture. " Using… (More)
  • figure 2
Is this relevant?
Highly Cited
1987
Highly Cited
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
We introduce a new representation for polyhedra by showing how Binary Space Partitioning Trees (BSP trees) can be used to… (More)
  • figure I
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer… (More)
  • table I
  • figure 3
  • table II
  • figure 4
  • table III
Is this relevant?
Highly Cited
1982
Highly Cited
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)
  • figure 1
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1972
Highly Cited
1972
A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keys… (More)
  • figure 2
  • figure 3
Is this relevant?