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

DOI10.1016/0020-0190(89)90048-3MaRDI QIDQ1123634zbMATH OpenOpenAlexFDO

Authors 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) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1156488
• scientific article; zbMATH DE number 3972877
• scientific article; zbMATH DE number 522859
• Ordered trees and the inorder traversal
• The stack-size of tries: A combinatorial study

Cites work

• A note on plane trees
• Generating t-Ary Trees Lexicographically
• scientific article; zbMATH DE number 3872676 (Why is no real title available?)
• scientific article; zbMATH DE number 3829270 (Why is no real title available?)
• scientific article; zbMATH DE number 4041254 (Why is no real title available?)
• scientific article; zbMATH DE number 3205162 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• 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
• Two short proofs of Kemp's identity for rooted plane trees

Cited in

(5)

• The scientific works of Rainer Kemp (1949--2004)
• scientific article; zbMATH DE number 3972877 (Why is no real title available?)
• scientific article; zbMATH DE number 522859 (Why is no real title available?)
• scientific article; zbMATH DE number 1156488 (Why is no real title available?)
• A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123634)