Live briefing
Everything about Random binary tree
Binary tree selected at random
In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees. Different distributions have been used, leading to different properties for these trees. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Random binary treeA 5-minute orientation
- Skim a recent paper: Option Pricing Using a Skew Random Walk Binary TreeInfluential work since 2022
- Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
- Read the landmark paper: The height of a random binary search treeCited 64 times
- Go sideways: Strahler numberA closely related topic
- Go sideways: TreapA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
The height of a random binary search tree
Regenerative tree growth: Binary self-similar continuum random trees and Poisson–Dirichlet compositions
On Random Binary Trees
Random sequential bisection and its associated binary tree
Anti‐collision algorithm based on slotted random regressive‐style binary search tree in RFID technology
Spanning tree size in random binary search trees
Greedy Search on the Binary Tree with Random Edge-Weights
A Block Cipher Algorithm for Multimedia Content Protection with Random Substitution using Binary Tree Traversal
🆕 Influential since 2022
Option Pricing Using a Skew Random Walk Binary Tree
Image Segmentation and Classification Fields Are Generated Using Binary Random Fields Based on Planar Graph and Neighborhood Spanning Tree
Precise Deviations for Branches of the Random Binary Tree in the Horton–Strahler Analysis
Errata for: Limit law for the cover time of a random walk on a binary tree
Scaling limit for the cover time of the λ-biased random walk on a binary tree with λ<1
📚 Books worth reading
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
Introduction to operations researchFrederick S. Hillier · 1967
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Automate the Boring Stuff with PythonAl Sweigart · 2015
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Starting Out with JavaTony Gaddis · 2004
A student's guide to coding and information theoryStefan M. Moser · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Strahler number In mathematics, the Strahler number or Horton–Strahler number of a mathematical tree is a numerical measure of its branching complexity. These numbers…
- Treap In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain…
- Cartesian tree In computer science, a Cartesian tree is a binary tree derived from a sequence of distinct numbers. To construct the Cartesian tree, set its root to be…
- Random recursive tree In probability theory, a random recursive tree is a rooted tree chosen uniformly at random from the recursive trees with a given number of vertices. In…
- Brownian tree In probability theory, the Brownian tree, or Aldous tree, or Continuum Random Tree (CRT) is a random real tree that can be defined from a Brownian excursion…
- Optimal binary search tree In computer science, an optimal binary search tree, or optimal BST, sometimes called a weight-balanced binary tree, is a binary search tree which provides…
- Tree traversal In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting…
- Bogosort In computer science, bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function…