A one-to-one correspondence between two classes of ordered trees

DOI10.1016/0020-0190(89)90048-3zbMath0677.68077OpenAlexW2058211217MaRDI QIDQ1123634

Rainer Kemp

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90048-3

zbMATH Keywords

combinatorial problemsdata structuresordered treespostorder- traversing

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

The scientific works of Rainer Kemp (1949--2004)

Cites Work

• Two short proofs of Kemp's identity for rooted plane trees
• On the number of deepest nodes in ordered trees
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• Generating t-Ary Trees Lexicographically
• A note on plane trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A one-to-one correspondence between two classes of ordered trees