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.
2018
2018
Many applications of point cloud have recently been identified in automobile navigation system, visual communication, and so on… 
Highly Cited
2008
Highly Cited
2008
We give a (ln n+1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T=(T1,…,Tm) and… 
Highly Cited
2001
Highly Cited
1995
Highly Cited
1995
The largest collection of ternary phase diagrams and related crystal structure data ever assembled can be found in this 10 volume… 
Highly Cited
1990
Highly Cited
1990
A pseudo-Gray code is an assignment of n-bit binary indexes to 2" points in a Euclidean space so that the Hamming distance… 
Highly Cited
1985
Highly Cited
1985
A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer… 
Highly Cited
1980