Generation Using Bijective Methods

  • Laurent Alonso
  • René Schott
Chapter

Abstract

In this chapter we show how to code a tree in some simple sequences and how to use this coding to generate easily a ternary tree with n nodes or a tree with n nodes.

Keywords

Induction Hypothesis Random Permutation Random Tree Cyclic Permutation Reciprocal Mapping 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Laurent Alonso
    • 1
  • René Schott
    • 1
  1. 1.CRINUniversité Henri PoincaréFrance

Personalised recommendations