The Average Height of Catalan Trees by Counting Lattice Paths

Nachum Dershowitz, Christian Rinderknecht

Research output: Contribution to journalArticlepeer-review

Abstract

The average height of Catalan trees of a given size is a structural parameter important in the analysis of algorithms, as it measures the expected maximum cost of a search in a tree. This parameter has been studied first with generating functions and complex variable theory, yielding an asymptotic approximation. Later on, real analysis was used instead of complex analysis. We have further reduced the conceptual difficulty by replacing generating functions with the enumeration of monotonic lattice paths, whose graphical representations make the derivation much more intuitive.

Original languageEnglish
Pages (from-to)187-195
Number of pages9
JournalMathematics Magazine
Volume88
Issue number3
DOIs
StatePublished - 2015

Fingerprint

Dive into the research topics of 'The Average Height of Catalan Trees by Counting Lattice Paths'. Together they form a unique fingerprint.

Cite this