Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Unsupervised word clustering algorithms --- which form word clusters based on a measure of distributional similarity --- have… 
Review
2010
Review
2010
Planets can form and survive in close binaries, although dynamical interactions with the secondary component can actually… 
2008
2008
Efficient forest management increases the demand for detailed, timely information. High spatial resolution remotely sensed… 
2006
2006
Determining which function or set of functions to use for managing memory in your Win32A‚™ application is difficult without a… 
2000
2000
This paper addresses linguistic and implementation problems for a practical LTAG parser raised by rich morphology in Korean. We… 
1995
1995
In Shih & Hsu, a planarity test was introduced utilizing a data structure called PC-trees, generalized from PQ-trees. They… 
Review
1992
Review
1992
We survey here results and problems from the reconstruction theory of evolutionary trees, which involve enumeration and inversion… 
1976
1976
The possibility of observing gravitational spin precession due to spin-orbit coupling in a binary pulsar system is considered. An… 
1974
1974
Felling or girdling willow oaks which exhibited Polyporus hispidus cankers reduced sporophore production within 3 yr. Since spore… 
1958
1958
This paper presents one phase of a cooperative field experiment dealing with the effects of nitrogen and irrigation treatments on…