Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Binary tree

Known as: Binary, Left child, Bifurcating arborescence 
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… Expand
Wikipedia

Related topics

Related topics

50 relations
AVL treeAmortized analysisBinary search algorithmBreadth-first search
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
The algebra of binary search trees
We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Symmetric binary B-Trees: Data structure and maintenance algorithms
SummaryA class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Support Vector Machines with Binary Tree Architecture for Multi-Class Classification
For multi-class classification with Support Vector Machines (SVMs) a binary decision tree architecture is proposed for… Expand
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Evaluation of piecewise affine control via binary search tree
We present an algorithm for generating a binary search tree that allows efficient computation of piecewise affine (PWA) functions… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Cache oblivious search trees via binary trees of small height
We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
HOPF ALGEBRA OF THE PLANAR BINARY TREES
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… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Efficient Collision Detection of Complex Deformable Models using AABB Trees
We present a scheme for exact collision detection between complex models undergoing rigid motion and deformation. The scheme… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Classification and Regression Trees
Background. Introduction to Tree Classification. Right Sized Trees and Honest Estimates. Splitting Rules. Strengthening and… Expand
  • figure 1
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The Average Height of Binary Trees and Other Simple Trees
Abstract The average height of a binary tree with n internal nodes is shown to be asymptotic to 2√ πn . This represents the… Expand
  • figure 1
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Multidimensional Binary Search Trees in Database Applications
The multidimensional binary search tree (abbreviated k-d tree) is a data structure for storing multikey records. This structure… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE