Monotonically labelled Motzkin trees
type: Item
instance of: scholarly article
title: Monotonically labelled Motzkin trees
zbMATH Open document ID: 0624.05026
DOI: 10.1016/0166-218X(87)90038-2
author: Johann Blieberger
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
review text: This paper gives asymptotic values for the number of monotonically labelled extended Motzkin trees and the number of monotonically labelled (not extended) binary trees. A Motzkin tree (or unary-binary tree) is either a single leaf or is built up repeatedly by an internal node with either one or two ordered subtrees. A monotonic labelling has the property that the nodes of a k-node tree are labelled 1,2,...,k so that any sequence connecting the root of the tree with a leaf is weakly monotone.
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 4012638
zbMATH Keywords: Motzkin trees
zbMATH Keywords: binary trees
reviewed by: Alan C. Tucker
MaRDI profile type: Publication
cites work: Asymptotic Methods in Enumeration
cites work: The average height of binary trees and other simple trees
cites work: Q5682013
cites work: On the average shape of monotonically labelled tree structures
cites work: Q3765796
cites work: Q3684137
cites work: Q4745838
cites work: On the Altitude of Nodes in Random Trees
cites work: On monotone functions of tree structures
description: scientific article; zbMATH DE number 4012638