Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Enumeration of binary trees

From MaRDI portal
Publication:1332756
Jump to:navigation, search

DOI10.1016/0020-0190(94)00083-2zbMath0810.05032OpenAlexW2013124115MaRDI QIDQ1332756

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

enumerationbinary trees


Mathematics Subject Classification ID

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


Related Items (2)

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ On generating \(k\)-ary trees in computer representation




Cites Work

  • Unnamed Item
  • A loopless algorithm for generating binary tree sequences
  • Counting and randomly generating binary trees




This page was built for publication: Enumeration of binary trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1332756&oldid=13465383"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki