Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.stat.math.independent

Topic: Generation of random binary trees
Replies: 10   Last Post: Mar 20, 2014 10:30 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ] Topics: [ Previous | Next ]
Gordon Sande

Posts: 119
Registered: 5/13/10
Re: Generation of random binary trees
Posted: Feb 28, 2014 7:25 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 2014-02-28 21:16:49 +0000, Mok-Kong Shen said:

> Am 28.02.2014 18:37, schrieb Herman Rubin:
>

>> Do you want equally likely labelled trees or equally likely
>> unlabelled ones? For the labelled trees, the method is fairly
>> easy; there are 2^(n-1)! labelled trees with n nodes, and going
>> from n-1 to n can be done by selecting a node at random and
>> branching there. For unlabelled trees, the problem is much
>> harder.

>
> Unlabelled. BTW, I forgot to mention that I am mainly interested
> in full binary trees (each internal node has exactly two children).


Then there is only one tree for a few special sizes. Or have I missed
something?

> M. K. Shen





Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.