A note on the Horton-Strahler number for random binary search trees
From MaRDI portal
Publication:294608
DOI10.1016/S0020-0190(98)00192-6zbMATH Open1339.68056OpenAlexW2072649690MaRDI QIDQ294608FDOQ294608
Authors: Paul Kruszewski 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001926?np=y
Recommendations
- A note on the Horton-Strahler number for random trees
- Large deviation theorem for branches of the random binary tree in the Horton-Strahler analysis
- Horton-Strahler ordering of random binary trees
- A note on the height of binary search trees
- The Horton-Strahler number of conditioned Galton-Watson trees
analysis of algorithmsprobabilistic analysisbifurcation ratio of human lungHorton-Strahler number/orderrandom binary search tree
Cites Work
- Title not available (Why is that?)
- A note on the height of binary search trees
- A note on the Horton-Strahler number for random trees
- The exact probabilities of branching patterns under terminal and segmental growth hypotheses
- On the Horton-Strahler number for random tries
- Cut trees in the topological analysis of branching patterns
- Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
Cited In (7)
- A note on Rémy's algorithm for generating random binary trees
- The Horton-Strahler number of conditioned Galton-Watson trees
- Horton-Strahler ordering of random binary trees
- A note on the Horton-Strahler number for random trees
- Title not available (Why is that?)
- An Improved Bound for Random Binary Search Trees with Concurrent Insertions
- On the Horton-Strahler number for random tries
This page was built for publication: A note on the Horton-Strahler number for random binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294608)
