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)

Related topics

Related topics

50 relations
AVL treeAmortized analysisBinary search algorithmBreadth-first search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Multi-Core LTSmin: Marrying Modularity and Scalability
The LTSMIN toolset provides multiple generation and on-the-fly analysis algorithms for large graphs (state spaces), typically… 
Highly Cited
2004
Highly Cited
2004
Monolithic Integration of Carbon Nanotube Devices with Silicon MOS Technology
An integrated circuit combining single-walled carbon nanotube (SWNT) devices with n-channel metal oxide semiconductor (NMOS… 
Highly Cited
2000
Highly Cited
2000
DSD: A schema language for XML
XML (eXtensible Markup Language) is a linear syntax for trees, which has gathered a remarkable amount of interest in industry… 
Highly Cited
1995
Highly Cited
1995
Near-optimal critical sink routing tree constructions
We present critical-sink routing tree (CSRT) constructions which exploit available critical-path information to yield high… 
1995
1995
An empirical assessment of priority queues in event-driven molecular dynamics simulation
Highly Cited
1994
Highly Cited
1994
The Trade o s of Multicast Trees and Algorithms
Multicast trees can be shared across sources shared trees or may be source speci c shortest path trees Inspired by recent… 
Highly Cited
1993
Highly Cited
1993
Hierarchical Scalable Photonic Architectures for High-Performance Processor Interconnection
Introduces two hierarchical optical structures for processor interconnection and compares their performance through analytic… 
Highly Cited
1991
Highly Cited
1991
Pipelined Communications in Optically Interconnected Arrays
Highly Cited
1987
Highly Cited
1987
Data Movement Techniques for the Pyramid Computer
The pyramid computer was initially proposed for performing high-speed low-level image processing. However, its regular geometry… 
Highly Cited
1984
Highly Cited
1984
Fault Tolerance in Binary Tree Architectures
Binary tree network architectures are applicable in the design of hierarchical computing systems and in specialized high… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)