Enumeration of Binary Trees and Universal Types
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number. Over the years various interesting questions about the statistics of such trees were investigated (e.g.,...
Main Authors: | Charles Knessl, Wojciech Szpankowski |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/607 |
Similar Items
-
Enumeration of Binary Trees and Universal Types
by: Charles Knessl, et al.
Published: (2005-01-01) -
Quicksort algorithm again revisited
by: Charles Knessl, et al.
Published: (1999-01-01) -
Quicksort algorithm again revisited
by: Charles Knessl, et al.
Published: (1999-12-01) -
Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees
by: Charles Knessl
Published: (2003-01-01) -
A New Binomial Recurrence Arising in a Graphical Compression Algorithm
by: Yongwook Choi, et al.
Published: (2012-01-01)