Algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Fundamentals of the Average Case Analysis of Particular Algorithms
Fundamentals of the Average Case Analysis of Particular Algorithms
A unified approach to the analysis of Horton-Strahler parameters of binary tree structures
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper, we introduce a class of extended binary trees that resembles all possible tree-structures of binary tries. Assuming a uniform distribution of those trees we prove that for being the number of internal nodes the average stack-size is given by . Since this result is quite similar to that for ordinary extended binary trees an attempt to find an explanation for that similarity using a quantitative level is made.