Skip to search formSkip to main contentSkip to account menu

Random binary tree

Known as: Random binary search tree 
In computer science and probability theory, a random binary tree refers to a binary tree selected at random from some probability distribution on… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Binary heapBinary treeCartesian treeCompiler

Broader (1)

Randomness

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Decision Diagram Techniques for Micro- and Nanoelectronic Design Handbook
FUNDAMENTALS OF DECISION DIAGRAM TECHNIQUES Introduction Data Structures Graphical Data Structures AND-EXOR Expressions, Trees… 
2009
2009
Structural complexity of random binary trees
For each positive integer n, let T<inf>n</inf> be a random rooted full binary tree having 2n-1 vertices. We can view H(T<inf>n… 
2007
2007
FAULT LOCATION IN DISTRIBUTION POWER SYSTEMS BY MEANS OF A TOOLBOX BASED ON N-ARY TREE DATA STRUCTURES
The problem of fault location has been studied deeply for transmission lines due its importance in power systems. Nowadays the… 
Review
2006
Review
2006
Results and Problems on Self-adjusting Search Trees and Related Data Structures
The splay tree is a form of self-adjusting search tree invented almost 25 years ago. Splay trees are remarkably efficient in both… 
2004
2004
On Robson's convergence and boundedness conjectures concerning the height of binary search trees
2004
2004
Spanning tree size in random binary search trees
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via… 
2002
2002
Binary trees having a given number of nodes with 0 , 1 , and 2 children
Note that k must always equal i+ 1 in a binary tree. Prodinger [P] recently computed the probability that a random binary tree… 
1995
1995
On the Variance of the Height of Random Binary Search Trees
Let $H_n$ be the height of a random binary search tree on $n$ nodes. We show that there exists a constant $\alpha = 4.31107\ldots… 
1993
1993
An evaluation of self‐adjusting binary search tree techniques
Much has been said in praise of self‐adjusting data structures, particularly self‐adjusting binary search trees. Self‐adjusting… 
1989
1989
A random binary tree generator
Let B(N) denote the set of all binary trees that have N nodes. A procedure for randomly generating the trees in B(N) such that… 
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)