Descendants and ascendants in binary trees.
Panholzer, Alois; Prodinger, Helmut
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1997)
- Volume: 1, Issue: 1, page 247-266
- ISSN: 1365-8050
Access Full Article
topHow to cite
topPanholzer, Alois, and Prodinger, Helmut. "Descendants and ascendants in binary trees.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 1.1 (1997): 247-266. <http://eudml.org/doc/120089>.
@article{Panholzer1997,
author = {Panholzer, Alois, Prodinger, Helmut},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {tree traversal; generating function; Zeilberger's algorithm},
language = {eng},
number = {1},
pages = {247-266},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Descendants and ascendants in binary trees.},
url = {http://eudml.org/doc/120089},
volume = {1},
year = {1997},
}
TY - JOUR
AU - Panholzer, Alois
AU - Prodinger, Helmut
TI - Descendants and ascendants in binary trees.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1997
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 1
IS - 1
SP - 247
EP - 266
LA - eng
KW - tree traversal; generating function; Zeilberger's algorithm
UR - http://eudml.org/doc/120089
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.