On the recursion depth of special tree traversal algorithms
From MaRDI portal
Publication:579943
DOI10.1016/0890-5401(87)90009-5zbMath0625.68048OpenAlexW2048490349MaRDI QIDQ579943
Peter Kirschenhofer, Prodinger, Helmut
Publication date: 1987
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(87)90009-5
Related Items (4)
Random trees in queueing systems with deadlines ⋮ FCFS-scheduling in a hard real-time environment under rush-hour conditions ⋮ Some investigations on FCFS scheduling in hard real time applications ⋮ On the Stack-Size of General Tries
Cites Work
- q-Catalan numbers
- The average height of binary trees and other simple trees
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- On the number of certain lattice polygons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the recursion depth of special tree traversal algorithms
