scientific article; zbMATH DE number 3757724

MaRDI QIDQ3940863zbMATH OpenFDO

Authors Ichiro Semba

Publication date 1982

zbMATH Keywords

average running time per binary tree

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cited in

(4)

• A note on generating binary trees inA-order andB-order
• Efficient generation of binary trees from inorder-postorder sequences
• Coding Binary Trees by Words over an Alphabet with Four Letters
• On enumerating tree permutations in natural order

This page was built for publication:

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