Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3757724

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

zbMATH Open0482.68064MaRDI QIDQ3940863FDOQ3940863


Authors: Ichiro Semba Edit this on Wikidata


Publication date: 1982



Title of this publication is not available (Why is that?)




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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3940863&oldid=17632926"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 22:53. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki