A one-to-one correspondence between two classes of ordered trees
type: Item
instance of: scholarly article
title: A one-to-one correspondence between two classes of ordered trees
zbMATH Open document ID: 0677.68077
DOI: 10.1016/0020-0190(89)90048-3
author: Rainer Kemp
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 4110141
zbMATH Keywords: combinatorial problems
zbMATH Keywords: data structures
zbMATH Keywords: ordered trees
zbMATH Keywords: postorder- traversing
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90048-3
OpenAlex ID: W2058211217
cites work: A note on plane trees
cites work: The number of registers required for evaluating arithmetic expressions
cites work: Q3339285
cites work: Q5333061
cites work: The average number of registers needed to evaluate a binary tree optimally
cites work: Q3674071
cites work: Q3779735
cites work: On the number of deepest nodes in ordered trees
cites work: Q5585020
cites work: Generating t-Ary Trees Lexicographically
cites work: Two short proofs of Kemp's identity for rooted plane trees
description: scientific article; zbMATH DE number 4110141