Enumeration of binary trees

DOI10.1016/0020-0190(94)00083-2MaRDI QIDQ1332756zbMATH OpenOpenAlexFDO

Authors Vinnakota Bapiraju, V. V. Bapeswara Rao

Publication date 13 October 1994

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

Full work available at URL https://doi.org/10.1016/0020-0190(94)00083-2

zbMATH Keywords

binary treesenumeration

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Review text

The authors present a procedure for listing binary trees of order \(n\) based on ternary sequences.

Cites work

• A loopless algorithm for generating binary tree sequences
• Counting and randomly generating binary trees
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)

Cited in

(10)

• On generating \(k\)-ary trees in computer representation
• Enumeration of binary trees compatible with a perfect phylogeny
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Enumerating Ordered Trees Lexicographically
• scientific article; zbMATH DE number 1788109 (Why is no real title available?)
• scientific article; zbMATH DE number 6928770 (Why is no real title available?)
• Enumeration of trees by inversions
• scientific article; zbMATH DE number 5279360 (Why is no real title available?)
• Counting labels in binary trees
• The rotation -lattice of ternary trees

This page was built for publication: Enumeration of binary trees

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