The joint distribution of the three types of nodes in uniform binary trees
From MaRDI portal
Publication:1346776
DOI10.1007/BF01190510zbMath0816.68094OpenAlexW1977903920MaRDI QIDQ1346776
Publication date: 9 April 1995
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01190510
Related Items
DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ On the number of vertices with a given degree in a Galton-Watson tree ⋮ On the internal structure of random recursive circuits
Cites Work
- Unnamed Item
- Unnamed Item
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- Limit laws for local counters in random binary search trees
- The Expected Performance of Traversal Algorithms in Binary Trees
- Analysis of algorithms on threaded trees