%0 Journal Article
%T Morgan Trees and Dyck Paths
%A Do£żli£ż
%A Tomislav
%J -
%D 2002
%X Sa£żetak A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enumerative results for Morgan trees on given number of vertices are obtained in terms of Catalan numbers. The results are further refined by enumerating all Morgan trees with prescribed number of internal vertices and by computing the average number of internal vertices in a Morgan tree
%K Morgan trees
%K Dyck paths
%K Catalan numbers
%K Narayana numbers
%U https://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=194587