Sur la génération des arbres binaires par les B-suites

DOI10.1016/0012-365X(84)90064-5zbMATH Open0546.05023OpenAlexW1966225667MaRDI QIDQ798328FDOQ798328

N. E. Zubov

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90064-5

zbMATH Keywords

binary treesB-sequence

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Title not available (Why is that?)
• Enumerations of ordered trees
• Lexicographic generation of ordered trees
• Constant Time Generation of Rooted Trees
• Generating Binary Trees Lexicographically
• Ranking and Listing Algorithms for k-Ary Trees
• A numbering system for binary trees
• A-transformation dans les arbres n-aires
• Generation of Binary Trees from Ballot Sequences

Cited In (7)

• A note on generating binary trees inA-order andB-order
• A note on the generation of binary trees
• Enumerating, Ranking and Unranking Binary Trees
• Generating trees withnnodes andmleaves
• On generating B-trees with constant average delay and in lexicographic order
• Title not available (Why is that?)
• Generation oft-ary trees with Ballot-sequences^*

   Recommendations

• A note on generating binary trees inA-order andB-order 👍 👎
• On the generation of binary trees inA-order 👍 👎
• Enumerating, Ranking and Unranking Binary Trees 👍 👎
• A note on the generation of binary trees 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Sur la génération des arbres binaires par les B-suites

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